Shortest-Path Queries in Geometric Networks (Q6065461): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Distance Oracles for Stretch Less Than 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The level ancestor problem simplified / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5115792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster approximate diameter and distance oracles in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal distance oracles for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Constructing Sparse Euclidean Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Euclidean Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-separated pair decomposition for the unit-disk graph metric and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles for geometric spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal shortest path queries in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Euclidean Shortest Paths in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance Oracles beyond the Thorup--Zwick Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3574258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path queries in static networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank

Latest revision as of 13:45, 3 August 2024

scientific article; zbMATH DE number 7765410
Language Label Description Also known as
English
Shortest-Path Queries in Geometric Networks
scientific article; zbMATH DE number 7765410

    Statements

    0 references
    14 November 2023
    0 references
    shortest path
    0 references
    Euclidean spanner
    0 references
    data structure
    0 references
    Shortest-Path Queries in Geometric Networks (English)
    0 references

    Identifiers