New spectral bounds on k-partitioning of graphs.
Robert ElsässerThomas LückingBurkhard MonienPublished in: SPAA (2001)
Keyphrases
- graph partitioning
- normalized cut
- spectral decomposition
- spectral methods
- spectral graph
- upper bound
- upper and lower bounds
- lower bound
- graph structure
- weighted graph
- spectral analysis
- graph matching
- error bounds
- partitioning algorithm
- graph theoretic
- graph structures
- directed graph
- graph clustering
- learning algorithm
- adjacency matrix
- lower and upper bounds
- average case
- hyperspectral imagery
- graph model
- graph theory
- hyperspectral
- neural network
- worst case bounds