Max-Cut and Max-Bisection are NP-hard on unit disk graphs

@article{Daz2007MaxCutAM,
  title={Max-Cut and Max-Bisection are NP-hard on unit disk graphs},
  author={Josep D{\'i}az and Marcin Kaminski},
  journal={Theor. Comput. Sci.},
  year={2007},
  volume={377},
  pages={271-276}
}
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 λ > 1/ √ 2 and give a dichotomy theorem for max-cut computational complexity on λ-precision unit disk graphs. 

From This Paper

Figures, tables, and topics from this paper.
7 Citations
15 References
Similar Papers

Similar Papers

Loading similar papers…