The complexity of the matching-cut problem for planar graphs and other graph classes.

Published in: J. Graph Theory (2009)

Keyphrases

planar graphs
matching algorithm
weighted graph
approximate inference
computational complexity
minimum weight
image matching
pairwise
bipartite graph
worst case
random walk
probabilistic inference
undirected graph
boundary points