M-Channel Perfect Recovery of Coarsened Graphs and Graph Signals With Spectral Invariance and Topological Preservation.
Soo-Chang PeiWen-Yang LuBo-Yi GuoPublished in: IEEE Trans. Signal Process. (2017)
Keyphrases
- spectral decomposition
- topological information
- graph representation
- spectral analysis
- graph matching
- directed graph
- adjacency matrix
- graph construction
- graph theory
- laplacian matrix
- spectral methods
- graph structures
- labeled graphs
- graph structure
- weighted graph
- graph databases
- frequency spectrum
- graph clustering
- graph classification
- series parallel
- graph model
- graph theoretic
- graph mining
- graph search
- random graphs
- structural pattern recognition
- bipartite graph
- graph partitioning
- graph properties
- connected components
- undirected graph
- graph theoretical
- graph data
- subgraph isomorphism
- random walk
- graph isomorphism
- neighborhood graph
- graph kernels
- dynamic graph
- graph representations
- graph patterns
- minimum spanning tree
- normalized cut
- real world graphs
- maximum common subgraph
- structured data
- spectral features
- single channel
- spanning tree
- web graph
- multi channel
- color reproduction
- adjacency graph
- directed acyclic
- evolving graphs
- attributed graphs
- community discovery
- reachability queries
- reeb graph
- planar graphs
- frequent subgraphs
- small world
- dense subgraphs
- maximal cliques