MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs (Q884483): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:50, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs |
scientific article |
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
