Triangle Sparsifiers
From MaRDI portal
Publication:2865055
DOI10.7155/jgaa.00245zbMath1276.05120OpenAlexW4230053343MaRDI QIDQ2865055
Mihail N. Kolountzakis, Charalampos E. Tsourakakis, Gary Lee Miller
Publication date: 28 November 2013
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00245
Related Items
Triangle counting in dynamic graph streams ⋮ Efficient Computation of the Weighted Clustering Coefficient ⋮ Approximately Counting Triangles in Sublinear Time ⋮ Colorful triangle counting and a \textsc{MapReduce} implementation ⋮ On Approximating the Number of $k$-Cliques in Sublinear Time ⋮ Efficient computation of the Weighted Clustering Coefficient ⋮ A Fast Counting Method for 6-Motifs with Low Connectivity
Uses Software
