On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations.
Frank GöringChristoph HelmbergSusanna ReissPublished in: SIAM J. Optim. (2013)
Keyphrases
- random walk
- normalized cut
- spectral decomposition
- graph theory
- directed graph
- weighted graph
- spectral methods
- graph structure
- graph partitioning
- graph representation
- spectral analysis
- graph construction
- bipartite graph
- graph matching
- structured data
- spectral features
- laplacian matrix
- graph search
- lower bound
- spectral graph partitioning
- minimum spanning tree
- graph theoretic
- multispectral images
- undirected graph
- directed acyclic graph
- connected components
- random variables
- graph cuts