Pages that link to "Item:Q4446912"
From MaRDI portal
The following pages link to On the power of BFS to determine a graph's diameter (Q4446912):
Displaying 12 items.
- An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time (Q2011037) (← links)
- Fellow travelers phenomenon present in real-world networks (Q2086588) (← links)
- Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (Q2347002) (← links)
- How to use spanning trees to navigate in graphs (Q2375948) (← links)
- Computing Giant Graph Diameters (Q2819520) (← links)
- Linear-time graph distance and diameter approximation (Q2827756) (← links)
- Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem (Q2958315) (← links)
- A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs (Q3008921) (← links)
- Incremental Map Generation (IMG) (Q3564294) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
- \( \alpha_i\)-metric graphs: radius, diameter and all eccentricities (Q6582369) (← links)
