MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs (Q884483)
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: MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs |
scientific article; zbMATH DE number 5161900
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs |
scientific article; zbMATH DE number 5161900 |
Statements
MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs (English)
0 references
6 June 2007
0 references
computational complexity
0 references
Max-cut
0 references
Max-bisection
0 references
NP-hard
0 references
unit disk graphs
0 references
0.8798547983169556
0 references
0.8095798492431641
0 references
0.801740288734436
0 references
0.7981266379356384
0 references
