An algorithmic framework for the single source shortest path problem with applications to disk graphs
DOI10.1016/J.COMGEO.2022.101979zbMATH Open1516.05210OpenAlexW4311769354MaRDI QIDQ6101843FDOQ6101843
Authors: Katharina Klost 
Publication date: 20 June 2023
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2022.101979
Recommendations
- An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs
- Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- A faster algorithm for the single source shortest path problem with few distinct positive lengths
- An algorithm for single-source shortest paths enumeration in parameterized weighted graphs
- Solving all-pairs shortest path by single-source computations: theory and practice
- A single-source shortest path algorithm for dynamic graphs
- scientific article; zbMATH DE number 3976361
- A novel single source shortest path algorithm
- A simple parallel algorithm for the single-source shortest path problem on planar digraphs
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distance in graphs (05C12) Paths and cycles (05C38)
Cites Work
- Computational geometry. Algorithms and applications.
- A sweepline algorithm for Voronoi diagrams
- Geometric approximation algorithms
- Shortest paths in intersection graphs of unit disks
- Geometry helps in bottleneck matching and related problems
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Intersection and Closest-Pair Problems for a Set of Planar Discs
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- Title not available (Why is that?)
- Reverse shortest path problem in weighted unit-disk graphs
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
Cited In (4)
This page was built for publication: An algorithmic framework for the single source shortest path problem with applications to disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6101843)
