5
$\begingroup$

Maxcuts are known to be NP-hard. Maxcuts in undirected planar graphs are known to be P.

I think I've seen somewhere an approximate solution to maxcuts in directed planar graphs but I've never heard of an exact algorithm. And I've never seen the answear if it is NP or not.

So is this problem solvable in polynomial time?

$\endgroup$
0

1 Answer 1

1
$\begingroup$

This paper http://web.cs.gc.cuny.edu/~mlampis/papers/dtreewidthDO.pdf proves MAX DICUT hard for DAGs, among other things. Not quite what you're looking for, but support for the idea that it's hard.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.