An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication.

Carlo Comin Romeo Rizzi

Published in: CoRR (2015)

Keyphrases

upper bound
matrix multiplication
maximal cliques
lower bound
graph theory
message passing
graph theoretic
branch and bound algorithm
matrix factorization
maximal clique enumeration
complex networks
distributed memory
fully connected
image segmentation
belief propagation
high precision
np hard