Approximate counting of cycles in streams

DOI10.1007/978-3-642-23719-5_57MaRDI QIDQ3092270zbMATH OpenOpenAlexFDO

Authors Madhusudan Manjunath, K. Mehlhorn, He Sun, Konstantinos 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) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Approximation algorithms (68W25)

Recommendations

• Counting arbitrary subgraphs in data streams
• scientific article; zbMATH DE number 6862103
• Computing and Combinatorics
• How hard is counting triangles in the streaming model?

Cited in

(10)

• 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: algorithms and experiments
• New bounds for the CLIQUE-GAP problem using graph decomposition theory
• Counting arbitrary subgraphs in data streams
• COUNTING LOW-PERIOD CYCLES FOR FLOWS
• Parallel Five-cycle Counting Algorithms
• Parallel five-cycle counting algorithms
• Counting simplices in hypergraph streams

This page was built for publication: Approximate counting of cycles in streams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092270)