Approximating <i>k</i>-node Connected Subgraphs via Critical Graphs (Q5700579): Difference between revisions
From MaRDI portal
Removed claims |
Added link to MaRDI item. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Guy Kortsarz / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Zeev Nutov / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 05:39, 7 March 2024
scientific article; zbMATH DE number 2220469
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating <i>k</i>-node Connected Subgraphs via Critical Graphs |
scientific article; zbMATH DE number 2220469 |
Statements
Approximating <i>k</i>-node Connected Subgraphs via Critical Graphs (English)
0 references
28 October 2005
0 references
connectivity
0 references
approximation
0 references
graphs
0 references
network design
0 references
