A second look at counting triangles in graph streams
From MaRDI portal
Publication:740973
DOI10.1016/j.tcs.2014.07.025zbMath1370.68119arXiv1401.2175OpenAlexW2084170146MaRDI QIDQ740973
Hossein Jowhari, Graham Cormode
Publication date: 10 September 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.2175
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items
New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory, New bounds for the CLIQUE-GAP problem using graph decomposition theory
Uses Software
Cites Work
- Colorful triangle counting and a \textsc{MapReduce} implementation
- Stream Order and Order Statistics: Quantile Estimation in Random-Order Streams
- Communication Complexity
- How Hard Is Counting Triangles in the Streaming Model?
- Experimental and Efficient Algorithms
- Computing and Combinatorics
- Unnamed Item
- Unnamed Item
- Unnamed Item