Polynomial time algorithms for 2-edge-connectivity augmentation problems (Q1402224): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:00, 31 January 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
19 August 2003
0 references
Augmentation problems
0 references
Graph algorithms
0 references
Data structures
0 references
Network survivability
0 references
