Approximating Clustering Coefficient and Transitivity

DOI10.7155/jgaa.00108zbMath1087.05056OpenAlexW2116759966MaRDI QIDQ3378518

Dorothea Wagner, Thomas Schank

Publication date: 3 April 2006

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

Full work available at URL: https://eudml.org/doc/52329

zbMATH Keywords

fast approximation algorithmgraph generator algorithm

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Network properties of healthy and Alzheimer brains ⋮ Large values of the clustering coefficient ⋮ Efficient Computation of the Weighted Clustering Coefficient ⋮ Predicting adolescent social networks to stop smoking in secondary schools ⋮ Approximately Counting Triangles in Sublinear Time ⋮ Colorful triangle counting and a \textsc{MapReduce} implementation ⋮ On Approximating the Number of $k$-Cliques in Sublinear Time ⋮ Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results ⋮ Influence of dynamical change of edges on clustering coefficients ⋮ On the Complexity of Sampling Vertices Uniformly from a Graph ⋮ An Experimental Study on Generating Planar Graphs ⋮ Main-memory triangle computations for very large (sparse (power-law)) graphs ⋮ Clustering coefficients of large networks ⋮ Clique Counting in MapReduce ⋮ Efficient computation of the Weighted Clustering Coefficient

This page was built for publication: Approximating Clustering Coefficient and Transitivity