The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree.

Markus Bläser Radu Curticapean

Published in: MFCS (2011)

Keyphrases

planar graphs
worst case
computational complexity
bounded degree
bounded treewidth
minimum weight
graphical models