A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph (Q4719338)
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: A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph |
scientific article; zbMATH DE number 1383714
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph |
scientific article; zbMATH DE number 1383714 |
Statements
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph (English)
0 references
18 December 2000
0 references
\(k\)-vertex connected graphs
0 references
