Login / Signup
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs.
Konrad Kazimierz Dabrowski
François Dross
Matthew Johnson
Daniël Paulusma
Published in:
IWOCA (2015)
Keyphrases
</>
bounded degree
bounded treewidth
graph theoretic
planar graphs
computational complexity
decision making
np hard
worst case
decision problems
graph matching
dynamic programming
graph theory
image inpainting
polynomial time complexity