A lower bound on the tree-width of graphs with irrelevant vertices.
Isolde AdlerPhilipp Klaus KrausePublished in: J. Comb. Theory, Ser. B (2019)
Keyphrases
- tree width
- lower bound
- tree decomposition
- branch and bound
- series parallel
- exact and approximate
- weighted graph
- upper bound
- structural properties
- shortest path
- relational structures
- graph theory
- constraint networks
- objective function
- np hard
- optimal solution
- graph matching
- lower and upper bounds
- worst case
- decomposition method
- constraint satisfaction problems
- parallel processing
- conjunctive queries
- search space
- relational databases
- bayesian networks