Minimum Cut of Directed Planar Graphs in O(nloglogn) Time.

Shay Mozes Cyril Nikolaev Yahav Nussbaum Oren Weimann

Published in: CoRR (2015)

Keyphrases

planar graphs
minimum cut
weighted graph
maximum flow
graph cuts
minimum weight
shortest path
graph partitioning
belief propagation
graph model
graph structure
directed graph
data objects
shape prior
computer vision
spanning tree
edge weights