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

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

2006-09-22

arxiv.org/abs/cs/0609128v1

Computer Science

Data Structures and Algorithms

Scientific paper

We prove that the Max-Cut and Max-Bisection problems are NP-hard on unit disk
graphs. We also show that $\lambda$-precision graphs are planar for $\lambda$ >
1 / \sqrt{2}$.

Affiliated with

Also associated with

No associations

Rating

Max-Cut and Max-Bisection are NP-hard on unit disk graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Max-Cut and Max-Bisection are NP-hard on unit disk graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Max-Cut and Max-Bisection are NP-hard on unit disk graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-129855