Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
From MaRDI portal
Publication:5894040
DOI10.1007/978-3-642-18009-5_3zbMath1311.05193arXiv1011.0468OpenAlexW3126084272MaRDI QIDQ5894040
Charalampos E. Tsourakakis, Richard Peng, Mihail N. Kolountzakis, Gary Lee Miller
Publication date: 21 January 2011
Published in: Algorithms and Models for the Web-Graph (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.0468
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Colorful triangle counting and a \textsc{MapReduce} implementation ⋮ An efficient exact algorithm for triangle listing in large graphs
This page was built for publication: Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
