A Simple Algorithm for Finding a Maximum Clique and Its Worst-Case Time Complexity.

Miklo Shindo Etsuji Tomita

Published in: Systems and Computers in Japan (1990)

Keyphrases

worst case time complexity
maximum clique
space complexity
objective function
np hard
linear programming
genetic algorithm
optimal solution
computational complexity
k means
search space
clustering method
branch and bound algorithm
vertex cover