|
-
December 3rd, 2010, 12:39 AM
#1
find K maximal cliques in boost graph library
Hi,
I need to find K maximal cliques in a graph. I am currently using C++ boost graph library, but I cannot find any library to support it.
Of course, the algorithm is not limited for boost graph library. If anyone knows where to find a C++ code for it, please let me know. Many thanks.
Joe
Tags for this Thread
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|