Counting matchings with k unmatched vertices in planar graphs.

Radu Curticapean

Published in: CoRR (2016)

Keyphrases

planar graphs
minimum weight
weighted graph
approximate inference
undirected graph
belief propagation