Lower bounds on the pathwidth of some grid-like graphs.
John EllisRobert WarrenPublished in: Discret. Appl. Math. (2008)
Keyphrases
- lower bound
- bounded treewidth
- upper bound
- branch and bound algorithm
- lower and upper bounds
- graph matching
- np hard
- branch and bound
- objective function
- np complete
- graph theoretic
- graph representation
- graph partitioning
- grid computing
- vc dimension
- optimal cost
- graph theory
- weighted graph
- directed graph
- graph model
- graph mining
- learning algorithm
- complex networks
- worst case
- quadratic assignment problem
- lower bounding
- computational complexity
- data structure
- grid points