Pages that link to "Item:Q1037772"
From MaRDI portal
The following pages link to Computing the dilation of edge-augmented graphs in metric spaces (Q1037772):
Displaying 10 items.
- Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time (Q359743) (← links)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- Computing optimal shortcuts for networks (Q2001454) (← links)
- Shortcut sets for the locus of plane Euclidean networks (Q2335528) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths (Q3448826) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees (Q5384465) (← links)
- (Q5743390) (← links)
