Pages that link to "Item:Q5906822"
From MaRDI portal
The following pages link to Faster shortest-path algorithms for planar graphs (Q5906822):
Displaying 36 items.
- Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities (Q3511369) (← links)
- FLOODING COUNTRIES AND DESTROYING DAMS (Q3575390) (← links)
- Link Distance and Shortest Path Problems in the Plane (Q3638449) (← links)
- Optimally fast shortest path algorithms for some classes of graphs (Q4236113) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
- Shortcutting Planar Digraphs (Q4862749) (← links)
- (Q5009574) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
- (Q5091049) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Faster algorithms for shortest path and network flow based on graph decomposition (Q5240369) (← links)
- Short and Simple Cycle Separators in Planar Graphs (Q5266605) (← links)
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes (Q5302069) (← links)
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time (Q5348455) (← links)
- (Q5743390) (← links)
- (Q5743478) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time (Q5886044) (← links)
- Accelerated Bend Minimization (Q5895514) (← links)
- Efficient dynamic approximate distance oracles for vertex-labeled planar graphs (Q5915659) (← links)
- Level-planar drawings with few slopes (Q5918472) (← links)
- An efficient oracle for counting shortest paths in planar graphs (Q5918687) (← links)
- Level-planar drawings with few slopes (Q5918990) (← links)
- Many distances in planar graphs (Q5920250) (← links)
- How to walk your dog in the mountains with no magic leash (Q5964220) (← links)
- An efficient oracle for counting shortest paths in planar graphs (Q5970820) (← links)
- Continuous mean distance of a weighted graph (Q6045116) (← links)
- On matchings, <i>T</i>‐joins, and arc routing in road networks (Q6065851) (← links)
- Non-crossing shortest paths lengths in planar graphs in linear time (Q6153472) (← links)
- Path planning in a weighted planar subdivision under the Manhattan metric (Q6184991) (← links)
- How vulnerable is an undirected planar graph with respect to max flow (Q6196897) (← links)
- Good \(r\)-divisions imply optimal amortized decremental biconnectivity (Q6614619) (← links)
