One strike against the min-max degree triangulation problem (Q685602)
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: One strike against the min-max degree triangulation problem |
scientific article; zbMATH DE number 417468
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One strike against the min-max degree triangulation problem |
scientific article; zbMATH DE number 417468 |
Statements
One strike against the min-max degree triangulation problem (English)
0 references
17 October 1993
0 references
The min-max degree triangulation problem is the following: Given a finite plane geometric graph \(G\) in \(R^ 2\), and an integer \(k\), is there a triangulation \(G'\) of \(G\) with maximum degree \(\leq k\)? The author shows that this problem is NP-complete for \(k\leq 7\).
0 references
triangulation
0 references
geometric graph
0 references
NP-complete
0 references
0.8669000267982483
0 references
0.8419461846351624
0 references
0.7834421992301941
0 references
0.7791174650192261
0 references
0.7770285606384277
0 references
