An algorithmic framework for the single source shortest path problem with applications to disk graphs (Q6101843): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in intersection graphs of unit disks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry helps in bottleneck matching and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal algorithms for shortest paths in weighted unit-disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse shortest path problem in weighted unit-disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing imprecise points for Delaunay triangulation: simplified and extended / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3010463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sweepline algorithm for Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection and Closest-Pair Problems for a Set of Planar Discs / rank
 
Normal rank

Latest revision as of 10:08, 1 August 2024

scientific article; zbMATH DE number 7699087
Language Label Description Also known as
English
An algorithmic framework for the single source shortest path problem with applications to disk graphs
scientific article; zbMATH DE number 7699087

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references