On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method.
Tony F. ChanPatrick Ciarlet Jr.W. K. SzetoPublished in: SIAM J. Sci. Comput. (1997)
Keyphrases
- vertex set
- normalized cut
- random walk
- laplacian matrix
- spectral clustering
- spectral decomposition
- weighted graph
- planar graphs
- image segmentation
- structured data
- spectral methods
- adjacency matrix
- directed graph
- bipartite graph
- minimum cut
- optimal solution
- graph structure
- graph model
- min cut
- spectral analysis
- social networks
- graph representation
- median filter
- hyperspectral
- graph theoretic
- hyperspectral images
- random graphs
- graph structures
- spanning tree
- maximum flow
- graph theory
- infrared
- k means
- neural network