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...

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica Ročník 76; číslo 1; s. 259 - 278
Hlavní autoři:	Bulteau, Laurent, Froese, Vincent, Kutzkov, Konstantin, Pagh, Rasmus
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.09.2016 Springer Verlag
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!