An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication.
Carlo CominRomeo RizziPublished in: Algorithmica (2018)
Keyphrases
- upper bound
- matrix multiplication
- maximal cliques
- lower bound
- graph theory
- message passing
- maximal clique enumeration
- matrix factorization
- graph theoretic
- fully connected
- distributed memory
- complex networks
- branch and bound algorithm
- protein interaction networks
- massive data
- social networks
- social network analysis
- optimization problems