Polynomial time algorithms for 2-edge-connectivity augmentation problems (Q1402224)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial time algorithms for 2-edge-connectivity augmentation problems |
scientific article; zbMATH DE number 1967773
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time algorithms for 2-edge-connectivity augmentation problems |
scientific article; zbMATH DE number 1967773 |
Statements
Polynomial time algorithms for 2-edge-connectivity augmentation problems (English)
0 references
19 August 2003
0 references
Augmentation problems
0 references
Graph algorithms
0 references
Data structures
0 references
Network survivability
0 references
