<p>Max Cut on a Undirected Graph has many algorithms when the Undirected Graph is Planar. 
I have been wondering though if one could generalise this to Directed Planar Graphs?</p>

CC BY-SA 2.5
2010-12-30T13:45:21.073Z
What does max cut on a directed graph mean?
Jelani Nelson
CC BY-SA 2.5
2010-12-30T14:19:00.857Z
@Jelani: Exactly what you would think - only edges crossing in one direction counts towards the size.
Kristoffer Arnsfelt Hansen
CC BY-SA 2.5
2010-12-30T14:21:54.817Z
The usual terminology is MAX DICUT.
Kristoffer Arnsfelt Hansen
<ds.algorithms>
Is there a algorithm for Max Cut on a Planar Directed Graph (MAX DIRECTED CUT ALGORITHM)?
Zelah 02
# Is there a algorithm for Max Cut on a Planar Directed Graph (MAX DIRECTED CUT ALGORITHM)?

(Asked by: username_0 on 2010-12-30)

Max Cut on a Undirected Graph has many algorithms when the Undirected Graph is Planar.
I have been wondering though if one could generalise this to Directed Planar Graphs?

**Tags:** ds.algorithms
> **Comments:**
> **username_1**: What does max cut on a directed graph mean?  
> **username_2**: @Jelani: Exactly what you would think - only edges crossing in one direction counts towards the size.  
> **username_2**: The usual terminology is MAX DICUT.  

---

## 0 answers

