On the Complexity of Covering Vertices by Faces in a Planar Graph.

Daniel Bienstock Clyde L. Monma

Published in: SIAM J. Comput. (1988)

Keyphrases

planar graphs
minimum weight
weighted graph
binary images
social networks
upper bound
worst case
graphical models
approximate inference