On the Complexity of Covering Vertices by Faces in a Planar Graph (Q3790663)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4055071
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Complexity of Covering Vertices by Faces in a Planar Graph |
scientific article; zbMATH DE number 4055071 |
Statements
On the Complexity of Covering Vertices by Faces in a Planar Graph (English)
0 references
1988
0 references
complexity
0 references
planar graph
0 references
embedding
0 references
polynomial-time recognition algorithm
0 references
Steiner tree
0 references
0.765292227268219
0 references
0.7641733884811401
0 references
0.7610857486724854
0 references
0.7555165886878967
0 references
