K-clique-graphs for Dense Subgraph Discovery.
Giannis NikolentzosPolykarpos MeladianosYannis StavrakasMichalis VazirgiannisPublished in: CoRR (2016)
Keyphrases
- quasi cliques
- graph mining
- frequently occurring
- independent set
- maximum clique
- graph databases
- biological networks
- graph properties
- graph matching
- graph theory
- pattern mining
- directed graph
- link prediction
- densely connected
- maximum independent set
- bayesian networks
- graph clustering
- stereo correspondence
- graphical models
- pattern recognition