Shortest path queries in planar graphs
DOI10.1145/335305.335359zbMATH Open1296.68108OpenAlexW1985248597MaRDI QIDQ3192016FDOQ3192016
Publication date: 26 September 2014
Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/335305.335359
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (24)
- An external memory data structure for shortest path queries
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automata, Languages and Programming
- A substring-substring LCS data structure
- Many distances in planar graphs
- Algorithms and Computation
- Shortest path queries in digraphs of small treewidth
- Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs.
- Title not available (Why is that?)
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs
- Title not available (Why is that?)
- Refined Vertex Sparsifiers of Planar Graphs
- Shortest-path queries in static networks
- Faster shortest-path algorithms for planar graphs
- Single-source shortest paths and strong connectivity in dynamic planar graphs
- Querying approximate shortest paths in anisotropic regions
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
- Title not available (Why is that?)
- Reachability oracles for directed transmission graphs
- Shortcutting Planar Digraphs
- Title not available (Why is that?)
- Non-crossing shortest paths in undirected unweighted planar graphs in linear time
This page was built for publication: Shortest path queries in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192016)
