Finding Densest Lasting Subgraphs in Dynamic Graphs: A Stochastic Approach.
Xuanming LiuTingjian GeYinghui WuPublished in: ICDE (2019)
Keyphrases
- graph mining
- dense subgraphs
- graph databases
- maximum clique
- pattern mining
- dynamic graph
- dynamic networks
- frequent subgraphs
- dynamic environments
- community discovery
- graph data
- labeled graphs
- maximum common subgraph
- subgraph matching
- graph theory
- functional modules
- graph structures
- pattern discovery
- graph matching
- maximal cliques
- subgraph isomorphism
- edge weights
- query graph
- connected components
- similarity graph
- monte carlo
- reachability queries
- subgraph mining
- data structure
- biological networks