CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK (Q5284939)

From MaRDI portal
Revision as of 00:41, 22 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 969565
Language Label Description Also known as
English
CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK
scientific article; zbMATH DE number 969565

    Statements

    CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK (English)
    0 references
    0 references
    0 references
    0 references
    22 January 1997
    0 references
    0 references
    cactus representation
    0 references
    minimum cuts
    0 references
    edge-weighted, undirected network
    0 references
    maximum flow
    0 references