A simple algorithm for multicuts in planar graphs with outer terminals.

Published in: Discret. Appl. Math. (2009)

Keyphrases

computational complexity
np hard
dynamic programming
objective function
planar graphs
worst case
linear programming
monte carlo
parameter estimation
max cut
convex hull
tree structure
random variables
em algorithm
expectation maximization
least squares
semi supervised