Pages that link to "Item:Q5088993"
From MaRDI portal
The following pages link to Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. (Q5088993):
Displaying 9 items.
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs (Q2223616) (← links)
- Shortest paths in intersection graphs of unit disks (Q2344058) (← links)
- (Q4636506) (← links)
- Simple heuristics for unit disk graphs (Q4698229) (← links)
- (Q5115792) (← links)
- An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane (Q5387800) (← links)
- ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs (Q6059994) (← links)
- An algorithmic framework for the single source shortest path problem with applications to disk graphs (Q6101843) (← links)