A fast algorithm for maximum integral two-commodity flow in planar graphs (Q1314324)

From MaRDI portal
Revision as of 12:03, 22 May 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
A fast algorithm for maximum integral two-commodity flow in planar graphs
scientific article

    Statements

    A fast algorithm for maximum integral two-commodity flow in planar graphs (English)
    0 references
    0 references
    0 references
    22 February 1994
    0 references
    maximum integral two-commodity flow problem
    0 references
    augmented planar graphs
    0 references

    Identifiers