A linear-time algorithm for edge-disjoint paths in planar graphs (Q1842575)

From MaRDI portal
Revision as of 08:33, 28 July 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
A linear-time algorithm for edge-disjoint paths in planar graphs
scientific article

    Statements

    A linear-time algorithm for edge-disjoint paths in planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 July 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    linear-time algorithm
    0 references
    planar graphs
    0 references
    edge-disjoint paths
    0 references
    evenness condition
    0 references
    theorem of Okamura and Seymour
    0 references