Pages that link to "Item:Q3801095"
From MaRDI portal
The following pages link to Fast Algorithms for Shortest Paths in Planar Graphs, with Applications (Q3801095):
Displaying 50 items.
- Reachability oracles for directed transmission graphs (Q2309470) (← links)
- Simple PTAS's for families of graphs excluding a minor (Q2352263) (← links)
- The fastest itinerary in time-dependent decentralized travel information systems (Q2369978) (← links)
- Planar graphs, negative weight edges, shortest paths, and near linear time (Q2496320) (← links)
- On temporal graph exploration (Q2662667) (← links)
- Fast generation of some classes of planar graphs (Q2741325) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Shortest paths in directed planar graphs with negative lengths (Q2930306) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (Q3012798) (← links)
- On the Discrete Unit Disk Cover Problem (Q3078392) (← links)
- Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures (Q3304759) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
- Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem (Q3557808) (← links)
- AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER (Q3560062) (← links)
- Optimally fast shortest path algorithms for some classes of graphs (Q4236113) (← links)
- On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs (Q4575632) (← links)
- An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications (Q4585060) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
- Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
- Searching among intervals and compact routing tables (Q4630246) (← links)
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
- Shortest path queries in digraphs of small treewidth (Q4645182) (← links)
- COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE (Q4650090) (← links)
- Shortcutting Planar Digraphs (Q4862749) (← links)
- (Q5002791) (← 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)
- A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs (Q5060135) (← links)
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)
- (Q5091005) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q5096337) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- (Q5111734) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Short and Simple Cycle Separators in Planar Graphs (Q5266605) (← links)
- ON THE DISCRETE UNIT DISK COVER PROBLEM (Q5300002) (← links)
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes (Q5302069) (← links)
- An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane (Q5387800) (← links)
- An efficient parallel algorithm for shortest paths in planar layered digraphs (Q5490027) (← links)
- (Q5743390) (← links)
- (Q5743393) (← links)
- (Q5743404) (← links)
- (Q5743478) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time (Q5886044) (← links)
- Faster shortest-path algorithms for planar graphs (Q5906822) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
