A lower bound for the tree-width of planar graphs with vital linkages
Isolde AdlerPhilipp Klaus KrausePublished in: CoRR (2010)
Keyphrases
- tree width
- planar graphs
- lower bound
- exact and approximate
- tree decomposition
- branch and bound
- upper bound
- structural properties
- partition function
- np hard
- lower and upper bounds
- constraint networks
- approximate inference
- worst case
- optimal solution
- objective function
- column generation
- shortest path
- minimum weight
- undirected graph
- belief propagation
- linear programming relaxation
- graphical models
- randomized algorithm
- search algorithm