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

From MaRDI portal
Revision as of 22:13, 8 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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