Stochastic graph filtering on time-varying graphs.
Elvin IsufiAndrea SimonettoAndreas LoukasGeert LeusPublished in: CAMSAP (2015)
Keyphrases
- graph representation
- graph structure
- graph matching
- graph theory
- weighted graph
- directed graph
- graph construction
- graph theoretic
- graph mining
- graph databases
- graph model
- graph classification
- adjacency matrix
- labeled graphs
- graph clustering
- random graphs
- graph isomorphism
- graph search
- graph partitioning
- graph theoretical
- graph structures
- series parallel
- graph data
- spanning tree
- graph properties
- bipartite graph
- subgraph isomorphism
- reachability queries
- dynamic graph
- structural pattern recognition
- graph kernels
- evolving graphs
- adjacency graph
- graph transformation
- dense subgraphs
- connected graphs
- connected dominating set
- undirected graph
- web graph
- minimum spanning tree
- structured data
- graph drawing
- random walk
- attributed graphs
- graph representations
- finding the shortest path
- link analysis
- average degree
- disk resident
- maximum common subgraph
- inexact graph matching
- graph layout
- maximal cliques
- community discovery
- real world graphs
- graph patterns
- planar graphs
- maximum clique
- query graph
- frequent subgraphs
- directed acyclic
- topological information
- association graph
- neighborhood graph
- spectral decomposition
- edge weights
- small world
- quasi cliques
- maximum cardinality
- connected components
- graph embedding
- maximum independent set
- polynomial time complexity