A fast algorithm for cactus representations of minimum cuts (Q2258383)

From MaRDI portal
Revision as of 07:24, 2 August 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
A fast algorithm for cactus representations of minimum cuts
scientific article

    Statements

    A fast algorithm for cactus representations of minimum cuts (English)
    0 references
    0 references
    0 references
    0 references
    3 March 2015
    0 references
    undirected network
    0 references
    cactus representation
    0 references
    minimum cut
    0 references
    maximum flow
    0 references
    graph algorithm
    0 references

    Identifiers