Pages that link to "Item:Q5406179"
From MaRDI portal
The following pages link to Fast computation of empirically tight bounds for the diameter of massive graphs (Q5406179):
Displaying 8 items.
- On the hyperbolicity of bipartite graphs and intersection graphs (Q317426) (← links)
- On computing the diameter of real-world undirected graphs (Q386904) (← links)
- Computing the eccentricity distribution of large graphs (Q1736547) (← links)
- Seeking community structure in networks via biogeography-based optimization with consensus dynamics (Q2161729) (← links)
- Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (Q2347002) (← links)
- On Computing the Gromov Hyperbolicity (Q2828207) (← links)
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis (Q5874469) (← links)
