Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning

DOI10.1080/15427951.2012.625260zbMath1245.05120OpenAlexW1542957328MaRDI QIDQ5891737

Richard Peng, Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary Lee Miller

Publication date: 29 August 2012

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.im/1339678186

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Internet topics (68M11)

Related Items (10)

Triangle counting in dynamic graph streams ⋮ Approximately Counting Triangles in Sublinear Time ⋮ The challenges of unbounded treewidth in parameterised subgraph counting problems ⋮ Finding small complete subgraphs efficiently ⋮ On Approximating the Number of $k$-Cliques in Sublinear Time ⋮ Sublinear-time algorithms for counting star subgraphs via edge sampling ⋮ Unnamed Item ⋮ Fooling views: a new lower bound technique for distributed computations under congestion ⋮ Parameterized aspects of triangle enumeration ⋮ Clique Counting in MapReduce

This page was built for publication: Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning