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

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.

• Type: Journal
• Year: 2006
• Where: CORR
• Authors: Josep Díaz, Marcin Kaminski
• Keywords: CORR 2006, Education, Max-bisection Problems, Max-cut, Unit Disk Graphs