Click here to Skip to main content
15,885,366 members
Please Sign up or sign in to vote.
0.00/5 (No votes)
I would like to know a fast algorithm to find only the clique number[^] (without actually finding the clique) of a graph with about 100 vertices.

Thank you.
Posted
Updated 8-Jun-10 23:10pm
v2

1 solution

Just follow the wiki entry to the algorithm for solving it:

[^]
 
Share this answer
 
Comments
Manfred Rudolf Bihy 5-Jan-11 12:29pm    
Good link! 5+

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900