Approximating Clustering Coefficient and Transitivity

DOI10.7155/jgaa.00108zbMath1087.05056MaRDI 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 algorithm; graph generator algorithm

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

68R10: Graph theory (including graph drawing) in computer science

68U35: Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

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