New spectral lower bounds on the bisection width of graphs.
Sergei L. BezrukovRobert ElsässerBurkhard MonienRobert PreisJean-Pierre TillichPublished in: Theor. Comput. Sci. (2004)
Keyphrases
- lower bound
- upper bound
- spectral decomposition
- branch and bound algorithm
- branch and bound
- objective function
- lower and upper bounds
- graph theory
- graph matching
- optimal solution
- graph structures
- quadratic assignment problem
- upper and lower bounds
- graph model
- graph mining
- graph representation
- hyperspectral images
- graph theoretic
- spectral analysis
- vertex set
- laplacian matrix
- graph structure
- directed graph
- spectral methods
- lower bounding
- spectral features
- worst case