Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5815477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness of \(k\)-vertex-connected subgraph augmentation problem |
scientific article; zbMATH DE number 5815477 |
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
0.8087553977966309
0 references
0.7985847592353821
0 references
0.7930234670639038
0 references
