Max Bisection problem is to partition the set of nodes into two equal size sets such that the number of crossing edges is maximum. Max Bisection is $NP$-complete on cubic graphs and also on planar graphs.

What is the complexity of Max Bisection on cubic planar graphs? Is it $NP$-complete?

Cross posted on mathOverflow

  • $\begingroup$ By "crossing edges" do you mean the edges whose endpoints are in both sets making up the bisection? $\endgroup$ – Joseph Malkevitch Jan 15 '11 at 4:01
  • $\begingroup$ Max Bisection is MAX CUT with additional requirement that the two node sets have the same cardinality. $\endgroup$ – Mohammad Al-Turkistany Jan 15 '11 at 8:23

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.