Spectral conditions for the reconstructibility of a graph.
Chris D. GodsilBrendan D. McKayPublished in: J. Comb. Theory, Ser. B (1981)
Keyphrases
- clustering method
- graph model
- spectral clustering
- laplacian matrix
- spectral decomposition
- normalized cut
- random walk
- structured data
- graph structure
- directed graph
- graph theory
- spectral methods
- graph partitioning
- graph representation
- sufficient conditions
- graph matching
- weighted graph
- spectral analysis
- spectral graph partitioning
- bipartite graph
- color images
- graph theoretic
- environmental conditions
- graph data
- graph mining
- graph kernels
- hyperspectral imagery
- np hard
- graph based algorithm
- stable set
- spectral images
- neural network
- data sets