Approximation algorithm for \(k\)-node connected subgraphs via critical graphs (Q3580964)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation algorithm for k-node connected subgraphs via critical graphs |
scientific article; zbMATH DE number 5770703
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithm for \(k\)-node connected subgraphs via critical graphs |
scientific article; zbMATH DE number 5770703 |
Statements
Approximation algorithm for k-node connected subgraphs via critical graphs (English)
0 references
15 August 2010
0 references
0.9684774875640868
0 references
0.8756447434425354
0 references
0.8751441240310669
0 references
0.8668085336685181
0 references
0.8607116341590881
0 references
