Graph Filtering with Quantization over Random Time-varying Graphs.
Leila Ben SaadElvin IsufiBaltasar Beferull-LozanoPublished in: GlobalSIP (2019)
Keyphrases
- graph representation
- graph theory
- directed graph
- graph matching
- graph structure
- graph construction
- graph theoretic
- labeled graphs
- weighted graph
- graph structures
- graph mining
- adjacency matrix
- graph databases
- graph model
- graph search
- random graphs
- graph clustering
- graph classification
- series parallel
- graph data
- graph theoretical
- graph kernels
- graph properties
- spanning tree
- bipartite graph
- edge weights
- graph partitioning
- subgraph isomorphism
- connected graphs
- inexact graph matching
- graph representations
- disk resident
- dynamic graph
- connected dominating set
- undirected graph
- graph transformation
- random walk
- graph layout
- reachability queries
- planar graphs
- adjacency graph
- neighborhood graph
- attributed graphs
- real world graphs
- quasi cliques
- maximum clique
- evolving graphs
- structured data
- minimum spanning tree
- finding the shortest path
- graph isomorphism
- directed acyclic
- structural pattern recognition
- graph patterns
- dense subgraphs
- link prediction
- average degree
- graph embedding
- graph drawing
- community discovery
- vertex set
- degree distribution
- directed acyclic graph
- social graphs
- topological information
- query graph
- quantization error
- shortest path