A lower bound on the tree-width of graphs with irrelevant vertices.
Isolde AdlerPhilipp Klaus KrausePublished in: CoRR (2019)
Keyphrases
- tree width
- lower bound
- tree decomposition
- branch and bound
- exact and approximate
- series parallel
- weighted graph
- upper bound
- structural properties
- shortest path
- graph theory
- relational structures
- constraint networks
- objective function
- lower and upper bounds
- np hard
- decomposition method
- optimal solution
- graph matching
- conjunctive queries
- worst case
- parallel processing
- integrity constraints
- first order logic
- data integration
- simulated annealing
- search space