scientific article; zbMATH DE number 7561636
From MaRDI portal
Publication:5092347
DOI10.4230/LIPIcs.ICALP.2019.143MaRDI QIDQ5092347
Laurent Viennot, Siddharth Gupta, Adrian Kosowski
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1803.06977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Eccentricity queries and beyond using hub labels ⋮ Sublinear search spaces for shortest path planning in grid and road networks ⋮ Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compact navigation and distance oracles for graphs with small treewidth
- Computing on a free tree via complexity-preserving mappings
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Shortest paths in digraphs of small treewidth. I: Sequential algorithms
- Sublinear-space distance labeling using hubs
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Robust Distance Queries on Massive Networks
- VC-Dimension and Shortest Path Algorithms
- Using Selective Path-Doubling for Parallel Shortest-Path Computations
- Parallel Shortcutting of Rooted Trees
- Highway Dimension and Provably Efficient Shortest Path Algorithms
- Shortest path queries in planar graphs
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
- Graph spanners
- Time–Work Tradeoffs of the Single-Source Shortest Paths Problem
- A Randomized Parallel Algorithm for Single-Source Shortest Paths
- Polylog-time and near-linear work approximation scheme for undirected shortest paths
- Reachability and Distance Queries via 2-Hop Labels
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners
- Algorithmic and Hardness Results for the Hub Labeling Problem
- Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons
- Planar spanners and approximate shortest path queries among obstacles in the plane
- Sublinear Distance Labeling
- Distance labeling in graphs
- Shortcutting Planar Digraphs
- Transitive-Closure Spanners
- Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
- Many distances in planar graphs
This page was built for publication:
