Pages that link to "Item:Q5307536"
From MaRDI portal
The following pages link to Fast and Simple Approximation of the Diameter and Radius of a Graph (Q5307536):
Displaying 7 items.
- On computing the diameter of real-world undirected graphs (Q386904) (← links)
- Fast approximation of betweenness centrality through sampling (Q1741154) (← links)
- Fast diameter computation within split graphs (Q2180143) (← links)
- Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (Q2347002) (← links)
- Computing Giant Graph Diameters (Q2819520) (← links)
- On Trade-Offs in External-Memory Diameter-Approximation (Q3512478) (← links)
- Fast approximation algorithms for the diameter and radius of sparse graphs (Q5495822) (← links)