Non-crossing shortest paths in undirected unweighted planar graphs in linear time (Q2097216): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Paolo Giulio Franciosa / rank
Normal rank
 
Property / author
 
Property / author: Paolo Giulio Franciosa / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4285207083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flow vitality in general and <i>st</i>‐planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for solving VLSI graph layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many distances in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest path queries in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365044 / 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: Q4607915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point-to-Point Shortest Path Algorithms with Preprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks / 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: Improved algorithms for min cut and max flow in undirected planar graphs / 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: Finding a noncrossing Steiner forest in plane graphs under a 2-face condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Distance Queries in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum<i>s</i>-<i>t</i>Cut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Non-Crossing Rectilinear Paths in Plane Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for edge-disjoint paths in planar graphs / rank
 
Normal rank

Latest revision as of 19:08, 30 July 2024

scientific article
Language Label Description Also known as
English
Non-crossing shortest paths in undirected unweighted planar graphs in linear time
scientific article

    Statements

    Non-crossing shortest paths in undirected unweighted planar graphs in linear time (English)
    0 references
    0 references
    0 references
    11 November 2022
    0 references
    planar graphs
    0 references
    non-crossing paths
    0 references
    shortest paths
    0 references
    undirected unweighted graphs
    0 references
    multiple pairs
    0 references
    external face
    0 references

    Identifiers