Triangle sparsifiers

DOI10.7155/JGAA.00245MaRDI QIDQ2865055zbMATH OpenOpenAlexFDO

Authors Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller

Publication date 28 November 2013

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00245

zbMATH Keywords

sparse graphstriangle counttriangle sparsifiers

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Efficient triangle counting in large graphs via degree-based vertex partitioning
• Approximately counting triangles in sublinear time
• Efficient triangle counting in large graphs via degree-based vertex partitioning
• A hybrid sampling scheme for triangle counting

Cited in

(8)

• Efficient Computation of the Weighted Clustering Coefficient
• Colorful triangle counting and a \textsc{MapReduce} implementation
• Approximately counting triangles in sublinear time
• A Fast Counting Method for 6-Motifs with Low Connectivity
• On approximating the number of k-cliques in sublinear time
• Efficient computation of the Weighted Clustering Coefficient
• Counting simplices in hypergraph streams
• Towards optimal dynamic indexes for approximate (and exact) triangle counting

Describes a project that uses

Uses Software

• DOULION

This page was built for publication: Triangle sparsifiers

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