All-pairs shortest paths in geometric intersection graphs
From MaRDI portal
Publication:4626306
Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
- All-pairs shortest paths in geometric intersection graphs
- More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
- Shortest paths in intersection graphs of unit disks
- An algorithmic framework for the single source shortest path problem with applications to disk graphs
- scientific article; zbMATH DE number 6861957
Cited in
(16)- All pairs shortest paths for graphs with small integer length edges
- The fine-grained complexity of multi-dimensional ordering properties
- Shortest paths in intersection graphs of unit disks
- All-pairs shortest paths in geometric intersection graphs
- Geometric Intersection Graphs: Do Short Cycles Help?
- Solving the all-pair shortest path query problem on interval and circular-arc graphs
- On reverse shortest paths in geometric proximity graphs
- Distance queries over dynamic interval graphs
- Distance queries over dynamic interval graphs
- Segment proximity graphs and nearest neighbor queries amid disjoint segments
- Shortest path separators in unit disk graphs
- Segment proximity graphs and nearest neighbor queries amid disjoint segments
- Compact representation of semilinear and terrain-like graphs
- An O(n n) algorithm for single-source shortest paths in disk graphs
- Separating two points with obstacles in the plane: improved upper and lower bounds
- Rectilinear link diameter and radius in a rectilinear polygonal domain
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)
