A More Efficient Algorithm for Finding a Maximum Clique with an Improved Approximate Coloring.

Etsuji Tomita Yoichi Sutani Takanori Higashi

Published in: PDPTA (2007)

Keyphrases

maximum clique
worst case
computational complexity
k means
np hard
clustering method
objective function
optimal solution
matching algorithm
similarity measure
pairwise
special case
particle swarm optimization
convex hull