Hi Raja, There is an algorithm in SIAM Journal of Computing, vol. 6, no. 3, 1977 "A New Algorithm for Generating All the Maximal Independent Sets". Finding maximal cliques is equivalent to finding maximal independent sets from a graph with all egdes replaced by non-edges and vice versa.
If you don't want to read the whole paper, which in my opinion is actually not easy to read, you can read part of it to get familiar with the symbols, and then implement the algorithm outline in Fig 2 in your own way. On Mar 24, 1:20 am, "Raja simman" <[EMAIL PROTECTED]> wrote: > Hi all, > I'm trying to solve a problem involving maximal clique. If there is a > better solution than brute force, please let me know.. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
