Many distances in planar graphs (Q5920250): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Planar spanners and approximate shortest path queries among obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many distances in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest path queries in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs, negative weight edges, shortest paths, and near linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graph decomposition and all pairs shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar separators and parallel polygon triangulation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster shortest-path algorithms for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in directed planar graphs with negative lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short path queries in planar graphs in constant time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Nested Dissection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small simple cycle separators for 2-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Stretch Factor of Euclidean Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The design of dynamic data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact oracles for reachability and approximate distances in planar digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796165 / rank
 
Normal rank

Latest revision as of 03:36, 5 July 2024

scientific article; zbMATH DE number 6028414
Language Label Description Also known as
English
Many distances in planar graphs
scientific article; zbMATH DE number 6028414

    Statements

    Many distances in planar graphs (English)
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    planar graphs
    0 references
    distances in graphs
    0 references
    separators
    0 references
    decomposition of graphs
    0 references
    data structure
    0 references
    0 references