Tree-width of graphs without a 3×3 grid minor.
Etienne BirmeléJ. Adrian BondyBruce A. ReedPublished in: Discret. Appl. Math. (2009)
Keyphrases
- tree width
- tree decomposition
- structural properties
- series parallel
- graph theory
- constraint networks
- relational structures
- graph matching
- shortest path
- exact and approximate
- probabilistic reasoning
- parallel processing
- conjunctive queries
- upper bound
- database systems
- branch and bound
- heuristic search
- np hard
- search space
- lower bound
- search algorithm