Decomposing a planar graph with girth 9 into a forest and a matching.

Oleg V. Borodin Alexandr V. Kostochka Naeem N. Sheikh Gexin Yu

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

Keyphrases

planar graphs
matching algorithm
image matching
objective function
special case
upper bound
maximum likelihood