Approximating the smallest 2-vertex-connected spanning subgraph via low-high orders (Q4580153)
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: Approximating the smallest 2-vertex-connected spanning subgraph via low-high orders |
scientific article; zbMATH DE number 6917124
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the smallest 2-vertex-connected spanning subgraph via low-high orders |
scientific article; zbMATH DE number 6917124 |
Statements
13 August 2018
0 references
2-vertex connectivity
0 references
approximation algorithms
0 references
directed graphs
0 references
0.9384323358535768
0 references
0.9306648969650269
0 references
0.9044496417045592
0 references
0.8307408690452576
0 references
0.807529091835022
0 references
