The complexity of finding two disjoint paths with min-max objective function (Q584275)

From MaRDI portal
Revision as of 14:50, 23 June 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
The complexity of finding two disjoint paths with min-max objective function
scientific article

    Statements

    The complexity of finding two disjoint paths with min-max objective function (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references