A new exact maximum clique algorithm for large and massive sparse graphs.

Pablo San Segundo Alvaro Lopez Panos M. Pardalos

Published in: Comput. Oper. Res. (2016)

Keyphrases

maximum clique
search space
worst case
computational complexity
similarity measure
objective function
optimal solution
np hard
simulated annealing
matching algorithm
high dimensional
special case
graph theory
undirected graph
fully connected
maximal cliques