Pages that link to "Item:Q4575887"

The following pages link to Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs (Q4575887):

Displayed 11 items.

• Faster approximate diameter and distance oracles in planar graphs (Q1999961) ‎ (← links)
• The inverse Voronoi problem in graphs. I: Hardness (Q2006948) ‎ (← links)
• An efficient noisy binary search in graphs via Median approximation (Q2115863) ‎ (← links)
• Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) ‎ (← links)
• (Q5002738) ‎ (← links)
• (Q5009573) ‎ (← links)
• Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) ‎ (← links)
• (Q5115792) ‎ (← links)
• An efficient oracle for counting shortest paths in planar graphs (Q5918687) ‎ (← links)
• An efficient oracle for counting shortest paths in planar graphs (Q5970820) ‎ (← links)
• Subquadratic-time algorithm for the diameter and all eccentricities on median graphs (Q6151151) ‎ (← links)