|
5
|
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? |
||
|
|
|
1
|
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. |
||
|
|
