Funded by the European Union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Education and Culture Executive Agency (EACEA). Neither the European Union nor EACEA can be held responsible for them.


Find graph clique algorithm

Users: 1 - Average Rating: 5.00

The algorithm has the following main features:
• It finds clique of a given graph
• Directed and undirected graphs are covered
• Linked to performance evaluation via related benchmark


Target Group:

Author of the review:
Andrej Košir
University of Ljubljana


You have to login to leave a comment. If you are not registered click here

Eligius Hendrix

Actually finding the max clique using an adjacency matrix is known to be a hard problem, i.e. if the number of nodes and the corresponding adjacency matrix increases, the computational time grows more than polynomial. That does not mean that practical problems can be solved using elegant implementations of practical agorithms as depicted here.