A graph approximation heuristic for the vertex cover problem on planar graphs (Q1328583)
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 graph approximation heuristic for the vertex cover problem on planar graphs |
scientific article; zbMATH DE number 611319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A graph approximation heuristic for the vertex cover problem on planar graphs |
scientific article; zbMATH DE number 611319 |
Statements
A graph approximation heuristic for the vertex cover problem on planar graphs (English)
0 references
26 July 1994
0 references
vertex cover problem
0 references
planar graphs
0 references
bipartite graphs
0 references
heuristic
0 references
0.8487563133239746
0 references
0.8154413104057312
0 references
0.8106968998908997
0 references
0.8101476430892944
0 references
