Approximate Distance Queries in Disk Graphs
From MaRDI portal
Recommendations
- Graph-Theoretic Concepts in Computer Science
- Approximate shortest paths and distance oracles in weighted unit-disk graphs
- scientific article; zbMATH DE number 7236428
- Better Approximation Schemes for Disk Graphs
- Linear-time graph distance and diameter approximation
- Improved distance queries in planar graphs
- Faster Approximation of Distances in Graphs
- scientific article; zbMATH DE number 2119744
- Approximate distance oracles for planar graphs with improved query time-space tradeoff
- Linear-time approximation algorithms for unit disk graphs
Cited in
(10)- An efficient sum query algorithm for distance-based locally dominating functions
- A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs
- Well-separated pair decomposition for the unit-disk graph metric and its applications
- Approximate shortest paths and distance oracles in weighted unit-disk graphs
- Improved Distance Queries and Cycle Counting by Frobenius Normal Form
- Triangles and girth in disk graphs and transmission graphs
- scientific article; zbMATH DE number 7236428 (Why is no real title available?)
- A unified framework for light spanners
- A unified framework of light spanners. I: Fast (yet optimal) constructions
- Seek distances in disks with two independent heads per surface
This page was built for publication: Approximate Distance Queries in Disk Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5443518)
