Approximate Counting of Cycles in Streams

DOI10.1007/978-3-642-23719-5_57zbMath1346.68257OpenAlexW2123033955MaRDI QIDQ3092270

He Sun, Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos D. Panagiotou

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_57

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (6)

Triangle counting in dynamic graph streams ⋮ New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory ⋮ New bounds for the CLIQUE-GAP problem using graph decomposition theory ⋮ Sublinear-time algorithms for counting star subgraphs via edge sampling ⋮ Structural results on matching estimation with applications to streaming ⋮ Clique Counting in MapReduce

This page was built for publication: Approximate Counting of Cycles in Streams