Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs.
Anna LeeGábor RévészJenö SzigetiZsolt TuzaPublished in: Discret. Math. (2001)
Keyphrases
- coefficient matrix
- sparse matrix
- singular value decomposition
- doubly stochastic
- low rank approximation
- graph matching
- gaussian graphical models
- graph theoretic
- connected graphs
- sparse data
- binary matrices
- low rank matrix
- adjacency matrix
- compressive sensing
- graph theory
- low rank matrices
- kronecker product
- rows and columns
- graph partitioning
- high dimensional
- least squares
- sparse representation
- graph structure
- eigenvalues and eigenvectors
- graph mining
- graphical models
- scheduling problem
- bipartite graph
- weighted graph
- directed graph
- matrix completion
- random walk
- graph representation
- graph kernels
- image segmentation