Graph minors. X. Obstructions to tree-decomposition.
Neil RobertsonPaul D. SeymourPublished in: J. Comb. Theory, Ser. B (1991)
Keyphrases
- tree decomposition
- tree width
- graph theory
- decomposition method
- probabilistic reasoning
- constraint networks
- branch and bound
- series parallel
- parallel processing
- answer set programming
- constraint satisfaction problems
- tree decompositions
- decomposition methods
- probabilistic inference
- structural properties
- constraint satisfaction
- upper bound
- computational complexity
- knowledge base
- lower bound
- search algorithm