Pages that link to "Item:Q3378518"
From MaRDI portal
The following pages link to Approximating Clustering Coefficient and Transitivity (Q3378518):
Displaying 15 items.
- Colorful triangle counting and a \textsc{MapReduce} implementation (Q413300) (← links)
- Main-memory triangle computations for very large (sparse (power-law)) graphs (Q955020) (← links)
- Predicting adolescent social networks to stop smoking in secondary schools (Q1681353) (← links)
- Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results (Q1711228) (← links)
- Influence of dynamical change of edges on clustering coefficients (Q1723215) (← links)
- Network properties of healthy and Alzheimer brains (Q2140440) (← links)
- Clustering coefficients of large networks (Q2292961) (← links)
- Large values of the clustering coefficient (Q2411602) (← links)
- Clique Counting in MapReduce (Q2828209) (← links)
- Efficient Computation of the Weighted Clustering Coefficient (Q2945270) (← links)
- An Experimental Study on Generating Planar Graphs (Q3004691) (← links)
- Approximately Counting Triangles in Sublinear Time (Q4593251) (← links)
- On the Complexity of Sampling Vertices Uniformly from a Graph (Q5002838) (← links)
- On Approximating the Number of $k$-Cliques in Sublinear Time (Q5115700) (← links)
- Efficient computation of the Weighted Clustering Coefficient (Q5856442) (← links)
