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:
CoRR (2015)
Keyphrases
</>
bounded degree
bounded treewidth
graph theoretic
worst case
np complete
databases
decision making
computational complexity
planar graphs
learning algorithm
decision makers
directed graph
graph theory