On Spectral Bounds for the k-Partitioning of Graphs.
Robert ElsässerThomas LückingBurkhard MonienPublished in: Theory Comput. Syst. (2003)
Keyphrases
- graph partitioning
- spectral decomposition
- upper bound
- normalized cut
- spectral methods
- lower bound
- partitioning algorithm
- upper and lower bounds
- worst case
- error bounds
- weighted graph
- hyperspectral imagery
- spectral analysis
- spectral graph
- laplacian matrix
- graph representation
- labeled graphs
- graph construction
- confidence bounds
- average case
- graph mining
- graph structure
- graph theory
- np hard
- clustering algorithm
- lower and upper bounds
- vc dimension
- data sets
- graph model
- spectral data
- graph matching
- directed graph
- knn