A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph (Q4719338): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jagm.1999.1006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984289304 / rank | |||
Normal rank | |||
Latest revision as of 23:48, 19 March 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
