Complexity and algorithms for the connected vertex cover problem in 4-regular graphs (Q1735245)
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: Complexity and algorithms for the connected vertex cover problem in 4-regular graphs |
scientific article; zbMATH DE number 7044007
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and algorithms for the connected vertex cover problem in 4-regular graphs |
scientific article; zbMATH DE number 7044007 |
Statements
Complexity and algorithms for the connected vertex cover problem in 4-regular graphs (English)
0 references
28 March 2019
0 references
connected vertex cover problem
0 references
approximation algorithm
0 references
4-regular graph
0 references
0 references
0.932192325592041
0 references
0.8391122221946716
0 references
0.8356187343597412
0 references
0.8260027170181274
0 references
0.8144600987434387
0 references
