Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus.
Jonathan A. KelnerPublished in: SIAM J. Comput. (2006)
Keyphrases
- laplacian matrix
- graph partitioning
- spectral decomposition
- normalized cut
- lower bound
- spectral methods
- adjacency matrix
- bounded treewidth
- upper bound
- graph laplacian
- spectral graph
- graph theoretic
- spectral clustering
- graph theory
- graph mining
- partitioning algorithm
- graph clustering
- graph structure
- graph model
- hough transform
- asymptotically optimal
- spectral analysis
- random graphs
- random walk
- subgraph isomorphism
- covariance matrix
- hyperspectral imagery
- error bounds
- graph construction
- graph representation
- weighted graph
- directed graph
- graph matching
- bipartite graph
- spectral features
- undirected graph
- least squares
- objective function