Reachability problems for transmission graphs
From MaRDI portal
Publication:5896888
DOI10.1007/978-3-030-83508-8_6OpenAlexW3196762502MaRDI QIDQ5896888
Publication date: 25 March 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.04973
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Separator theorems and Turán-type results for planar intersection graphs
- Routing in unit disk graphs
- Relaxed spanners for directed disk graphs
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- Shortest paths in intersection graphs of unit disks
- Voronoi Diagram in the Laguerre Geometry and Its Applications
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Spanners for Directed Transmission Graphs
- Approximate distance oracles for geometric spanners
- Spanners and Reachability Oracles for Directed Transmission Graphs
- On Generalized Planar Skyline and Convex Hull Range Queries
- Shortest-Path Queries in Geometric Networks