Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Approximating theDomatic Number / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation Algorithms for Several Graph Augmentation Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hardness of Approximation for Vertex-Connectivity Network Design Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The hardness of approximation: Gap location / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4527015 / rank | |||
Normal rank | |||
Revision as of 10:50, 3 July 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
