Finding the maximum cut of a graph (MAXCUT) is a classic optimization pr...
We consider the ideal orientation problem in planar graphs. In this prob...
Let G be a directed graph with n vertices and m edges, embedded on a
sur...
We consider the problem of finding maximum flows in planar graphs with
c...