Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519)

From MaRDI portal
Revision as of 19:29, 25 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths
scientific article

    Statements

    Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (English)
    0 references
    0 references
    0 references
    0 references
    16 March 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    planar graph
    0 references
    minimum cut
    0 references
    shortest cycle
    0 references
    girth
    0 references