Faster construction of a planar distance oracle with O(1) query time
From MaRDI portal
Publication:7346465
Cites work
- A Separator Theorem for Planar Graphs
- Almost optimal distance oracles for planar graphs
- Almost optimal exact distance oracles for planar graphs
- An almost optimal edit distance oracle
- Applications of a Planar Separator Theorem
- Approximate distance oracles for planar graphs with improved query time-space tradeoff
- Better tradeoffs for exact distance oracles in planar graphs
- Compact oracles for reachability and approximate distances in planar digraphs
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs
- Efficient algorithms for shortest path queries in planar digraphs
- Exact distance oracles for planar graphs
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Fast and compact exact distance oracle for planar graphs
- Faster approximate diameter and distance oracles in planar graphs
- Finding small simple cycle separators for 2-connected planar graphs
- Holiest minimum-cost paths and flows in surface graphs
- scientific article; zbMATH DE number 6850341 (Why is no real title available?)
- scientific article; zbMATH DE number 2119743 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 6469225 (Why is no real title available?)
- scientific article; zbMATH DE number 7788487 (Why is no real title available?)
- scientific article; zbMATH DE number 7788598 (Why is no real title available?)
- Improved distance queries in planar graphs
- Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
- Many distances in planar graphs
- Matching is as easy as matrix inversion
- Min \(st\)-cut oracle for planar graphs with near-linear preprocessing time
- Min-cuts and shortest cycles in planar graphs in O(n n) time
- More compact oracles for approximate distances in undirected planar graphs
- Multiple-source shortest paths in embedded graphs
- Multiple-source shortest paths in planar graphs
- Optimal approximate distance oracle for planar graphs
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Planar spanners and approximate shortest path queries among obstacles in the plane
- Shortest path queries in planar graphs
- Single-source shortest paths and strong connectivity in dynamic planar graphs
- Structured recursive separator decompositions for planar graphs in linear time
- Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs
- Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
This page was built for publication: Faster construction of a planar distance oracle with \(\tilde{O}(1)\) query time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346465)
