Augmenting Graphs to Meet Edge-Connectivity Requirements (Q3989009)

From MaRDI portal
Revision as of 21:39, 6 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56519177, #quickstatements; #temporary_batch_1709751086066)
scientific article
Language Label Description Also known as
English
Augmenting Graphs to Meet Edge-Connectivity Requirements
scientific article

    Statements

    title
    Augmenting Graphs to Meet Edge-Connectivity Requirements (English)
    0 references
    DOI
    10.1137/0405003
    0 references
    author
    András Frank
    0 references
    publication date
    28 June 1992
    0 references
    Mathematics Subject Classification ID
    05C40
    0 references
    90B99
    0 references
    68R10
    0 references
    zbMATH DE Number
    33675
    0 references
    zbMATH Keywords
    combinatorial optimization
    0 references
    edge-connectivity
    0 references
    polynomial time algorithm
    0 references
    splitting theorems
    0 references
    polymatroids
    0 references
    Wikidata QID
    Q56519177
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3989009&oldid=29993080"
    Powered by MediaWiki