Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph.

Yingqian Wang Jinghan Xu

Published in: Eur. J. Comb. (2015)

Keyphrases

planar graphs
image matching
matching algorithm
weighted graph
feature points
directed graph
undirected graph
minimum weight
image segmentation
special case
dynamic programming
approximate inference
spanning tree