Loading...
Loading...

Go to the content (press return)

MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs

Author
Diaz, J.; Kaminski, M.
Type of activity
Journal article
Journal
Theoretical computer science
Date of publication
2007-05
Volume
377
Number
1-3
First page
271
Last page
276
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants