Reducing rank of the adjacency matrix by graph modification.
Syed Mohammad MeesumPranabendu MisraSaket SaurabhPublished in: Theor. Comput. Sci. (2016)
Keyphrases
- adjacency matrix
- graph representation
- low rank approximation
- graph matching
- graph partitioning
- directed graph
- weighted graph
- graph edit distance
- eigenvalues and eigenvectors
- graph model
- undirected graph
- graph clustering
- laplacian matrix
- positive definite
- edit distance
- random walk
- normalized cut
- object recognition
- social networks
- graph structure
- level set
- pairwise