MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs (Q884483): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064530627 / rank | |||
Normal rank | |||
Revision as of 02:56, 20 March 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
