Polynomial time algorithms for 2-edge-connectivity augmentation problems (Q1402224): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-003-1024-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2122570469 / rank | |||
Normal rank | |||
Latest revision as of 02:13, 20 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
19 August 2003
0 references
Augmentation problems
0 references
Graph algorithms
0 references
Data structures
0 references
Network survivability
0 references
