Polynomial time algorithms for 2-edge-connectivity augmentation problems (Q1402224)

From MaRDI portal
Revision as of 17:00, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Polynomial time algorithms for 2-edge-connectivity augmentation problems
scientific article

    Statements

    title
    Polynomial time algorithms for 2-edge-connectivity augmentation problems (English)
    0 references
    author
    Anna Galluccio
    0 references
    Guido Proietti
    0 references
    published in
    Algorithmica
    0 references
    publication date
    19 August 2003
    0 references
    zbMATH DE Number
    1967773
    0 references
    zbMATH Keywords
    Augmentation problems
    0 references
    Graph algorithms
    0 references
    Data structures
    0 references
    Network survivability
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1402224&oldid=13561340"
    Powered by MediaWiki