A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph (Q4719338): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Vincenzo Auletta / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Zeev Nutov / rank | |||
Normal rank | |||
Revision as of 10:42, 12 February 2024
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
