The hardness of routing two pairs on one face (Q662307)

From MaRDI portal
Revision as of 23:04, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The hardness of routing two pairs on one face
scientific article

    Statements

    The hardness of routing two pairs on one face (English)
    0 references
    0 references
    22 February 2012
    0 references
    integer multiflows
    0 references
    planar graphs
    0 references
    disjoint paths
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references