Pages that link to "Item:Q2827756"
From MaRDI portal
The following pages link to Linear-time graph distance and diameter approximation (Q2827756):
Displaying 10 items.
- A linear-space algorithm for distance preserving graph embedding (Q1005326) (← links)
- Almost diameter of a house-hole-free graph in linear time via LexBFS (Q1302159) (← links)
- Simple linear time approximation algorithm for betweenness (Q1939683) (← links)
- On the power of BFS to determine a graph's diameter (Q4446912) (← links)
- Approximating the Diameter of Planar Graphs in Near Linear Time (Q4962209) (← links)
- Fast and Simple Approximation of the Diameter and Radius of a Graph (Q5307536) (← links)
- A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs (Q5363094) (← links)
- Approximate Distance Queries in Disk Graphs (Q5443518) (← links)
- Efficient Point-to-Point Resistance Distance Queries in Large Graphs (Q5886033) (← links)
- The diameter of AT‐free graphs (Q6057658) (← links)