A spectral lower bound for the treewidth of a graph and its consequences.
L. Sunil ChandranC. R. SubramanianPublished in: Inf. Process. Lett. (2003)
Keyphrases
- lower bound
- upper bound
- bounded treewidth
- graph structure
- branch and bound
- graph theory
- branch and bound algorithm
- random walk
- laplacian matrix
- spectral methods
- space complexity
- spectral decomposition
- lower and upper bounds
- graph model
- search space
- directed graph
- worst case
- constant factor
- weighted graph
- np hard
- graph representation
- bipartite graph
- normalized cut
- undirected graph
- spanning tree
- np complete
- linear programming relaxation
- connected components
- spectral clustering
- graph matching
- optimal solution
- objective function