Computational complexity of the vertex cover problem in the class of planar triangulations (Q1744983)
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: Computational complexity of the vertex cover problem in the class of planar triangulations |
scientific article; zbMATH DE number 6862370
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of the vertex cover problem in the class of planar triangulations |
scientific article; zbMATH DE number 6862370 |
Statements
Computational complexity of the vertex cover problem in the class of planar triangulations (English)
0 references
20 April 2018
0 references
It is shown that the vertex cover problem is strongly NP-hard for simple 4-connected planar triangulations on \(n\) vertices with a triangular outer face and vertex degrees at most \(\log n +9\).
0 references
computational complexity
0 references
Delaunay triangulation
0 references
Delaunay TD-triangulation
0 references
0 references
0 references
0.7741842865943909
0 references
0.7721367478370667
0 references
0.7645496726036072
0 references
0.7602199912071228
0 references
0.754627525806427
0 references
