Degree-constrained decompositions of graphs: Bounded treewidth and planarity.

Cristina Bazgan Zsolt Tuza Daniel Vanderpooten

Published in: Theor. Comput. Sci. (2006)

Keyphrases

bounded treewidth
np complete
decision problems
conjunctive queries
boolean functions
highly parallelizable
relational learning
computational complexity
constraint satisfaction problems
fixed parameter tractable
bounded degree
query language
autonomous agents