Knapsack Intersection Graphs and Efficient Computation of Their Maximal Cliques.
Valentin E. BrimkovPublished in: CompIMAGE (2014)
Keyphrases
- efficient computation
- maximal cliques
- graph theory
- graph theoretic
- maximal clique enumeration
- maximum clique
- computational efficiency
- association graph
- massive data
- fully connected
- complex networks
- protein interaction networks
- optimal solution
- database
- upper bound
- collaborative filtering
- distributed environment
- data analysis
- database systems
- neural network