New Spectral Lower Bounds on the Bisection Width of Graphs.
Sergei L. BezrukovRobert ElsässerBurkhard MonienRobert PreisJean-Pierre TillichPublished in: WG (2000)
Keyphrases
- lower bound
- spectral decomposition
- upper bound
- branch and bound algorithm
- branch and bound
- graph matching
- objective function
- np hard
- spectral methods
- vc dimension
- optimal solution
- lower and upper bounds
- spectral analysis
- vertex set
- directed graph
- spectral features
- worst case
- image segmentation
- spanning tree
- hyperspectral images
- upper and lower bounds