Efficient algorithm for finding all minimal edge cuts of a nonoriented graph (Q3032277)

From MaRDI portal
Revision as of 10:27, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
scientific article

    Statements

    title
    Efficient algorithm for finding all minimal edge cuts of a nonoriented graph (English)
    0 references
    DOI
    10.1007/BF01074775
    0 references
    published in
    Cybernetics
    0 references
    publication date
    1986
    0 references
    zbMATH DE Number
    4130408
    0 references
    zbMATH Keywords
    algorithm
    0 references
    minimal edge cut
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3032277&oldid=27446876"
    Powered by MediaWiki