Sampling Theory for Graph Signals on Product Graphs.
Rohan VarmaJelena KovacevicPublished in: CoRR (2018)
Keyphrases
- graph theory
- graph matching
- graph representation
- directed graph
- graph construction
- graph mining
- graph structure
- graph databases
- graph theoretic
- series parallel
- graph structures
- graph classification
- labeled graphs
- weighted graph
- graph data
- frequent subgraph mining
- bipartite graph
- graph properties
- graph transformation
- adjacency matrix
- graph model
- graph clustering
- graph partitioning
- minimum spanning tree
- spanning tree
- graph theoretical
- graph kernels
- dynamic graph
- directed acyclic
- graph search
- graph representations
- planar graphs
- random walk
- maximum clique
- structural pattern recognition
- dense subgraphs
- subgraph isomorphism
- undirected graph
- maximum common subgraph
- community discovery
- frequent subgraphs
- random graphs
- adjacency graph
- signal processing
- social graphs
- attributed graphs
- connected graphs
- finding the shortest path
- connected components
- reachability queries
- directed acyclic graph
- spectral analysis
- graph isomorphism
- real world graphs
- graph patterns
- association graph
- maximal cliques
- polynomial time complexity
- average degree
- bounded degree
- community detection
- graph layout
- maximum cardinality
- inexact graph matching
- attributed relational graph
- connected dominating set