Polynomial time algorithms for 2-edge-connectivity augmentation problems (Q1402224): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 04:13, 5 March 2024

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