| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438598 | Theoretical Computer Science | 2007 | 6 Pages |
Abstract
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that λ-precision graphs are planar for and give a dichotomy theorem for max-cut computational complexity on λ-precision unit disk graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
