Pages that link to "Item:Q4629989"
From MaRDI portal
The following pages link to Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs (Q4629989):
Displaying 13 items.
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← links)
- Better distance labeling for unweighted planar graphs (Q832885) (← links)
- Compact distributed certification of planar graphs (Q2037111) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Medians in median graphs and their cube complexes in linear time (Q2119403) (← links)
- Eccentricity queries and beyond using hub labels (Q2166770) (← links)
- Beyond Helly graphs: the diameter problem on absolute retracts (Q2672446) (← links)
- Distance problems within Helly graphs and \(k\)-Helly graphs (Q2682928) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Continuous mean distance of a weighted graph (Q6045116) (← links)
- The diameter of AT‐free graphs (Q6057658) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
- Better distance labeling for unweighted planar graphs (Q6103529) (← links)
