Triangle Counting in Dynamic Graph Streams

Estimating the number of triangles in graph streams using a limited amount of memory has become a popular topic in the last decade. Different variations of the problem have been studied, depending on whether the graph edges are provided in an arbitrary order or as incidence lists. However, with a fe...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 76; H. 1; S. 259 - 278
Hauptverfasser:	Bulteau, Laurent, Froese, Vincent, Kutzkov, Konstantin, Pagh, Rasmus
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.09.2016 Springer Verlag
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Bioinformatics Computational Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Algorithms Data Structures and Information Theory Mathematics of Computing Theory of Computation Streaming algorithms Triangle counting Randomized approximation algorithms
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!