The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes.

Published in: WG (2003)

Keyphrases

planar graphs
matching algorithm
minimum weight
image matching
weighted graph
approximate inference
worst case
bayesian networks
computational complexity
special case
upper bound
feature points
random walk
belief propagation