Polytopal Graph Complexity, Matrix Permanents, and Embedding.
Francisco EscolanoEdwin R. HancockMiguel Angel LozanoPublished in: SSPR/SPR (2008)
Keyphrases
- adjacency matrix
- graph theory
- computational cost
- eigenvalues and eigenvectors
- directed graph
- computational complexity
- graph structure
- random walk
- graph embedding
- nodes of a graph
- spectral embedding
- transition matrix
- matrix representation
- graph representation
- graph mining
- connected components
- covariance matrix
- worst case