A parallel maximum clique algorithm for large and massive sparse graphs.

Pablo San Segundo Alvaro Lopez Jorge Artieda Panos M. Pardalos

Published in: Optim. Lett. (2017)

Keyphrases

maximum clique
objective function
optimal solution
k means
np hard
clustering method
similarity measure
search space
graph matching
fully connected
protein structure alignment
genetic algorithm
worst case
social network analysis
graph theoretic
optimality criterion