Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-008-9206-5 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-008-9206-5 / rank | |||
Normal rank | |||
Revision as of 05:04, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of \(k\)-vertex-connected subgraph augmentation problem |
scientific article |
Statements
Hardness of \(k\)-vertex-connected subgraph augmentation problem (English)
0 references
12 November 2010
0 references
network survivability
0 references
graph connectivity
0 references
