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

From MaRDI portal
Revision as of 02:13, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Polynomial time algorithms for 2-edge-connectivity augmentation problems
scientific article

    Statements

    Polynomial time algorithms for 2-edge-connectivity augmentation problems (English)
    0 references
    0 references
    0 references
    0 references
    19 August 2003
    0 references
    0 references
    Augmentation problems
    0 references
    Graph algorithms
    0 references
    Data structures
    0 references
    Network survivability
    0 references
    0 references