Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752): 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/s10878-008-9206-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2143720330 / rank | |||
Normal rank | |||
Revision as of 02:11, 20 March 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
