All-pairs shortest paths in geometric intersection graphs
DOI10.20382/JOCG.V10I1A2zbMATH Open1417.68152OpenAlexW3023578497MaRDI QIDQ4626306FDOQ4626306
Timothy M. Chan, Dimitrios Skrepetos
Publication date: 27 February 2019
Full work available at URL: https://experts.illinois.edu/en/publications/all-pairs-shortest-paths-in-geometric-intersection-graphs-2
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (8)
- Rectilinear link diameter and radius in a rectilinear polygonal domain
- Distance queries over dynamic interval graphs
- Shortest paths in intersection graphs of unit disks
- All pairs shortest paths for graphs with small integer length edges
- On reverse shortest paths in geometric proximity graphs
- Solving the all-pair shortest path query problem on interval and circular-arc graphs
- Geometric Intersection Graphs: Do Short Cycles Help?
- The fine-grained complexity of multi-dimensional ordering properties
This page was built for publication: All-pairs shortest paths in geometric intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4626306)
