
Boost Users : 
Subject: [Boostusers] Counting all cliques of a given size in an undirected graph
From: Andrea Cassioli (cassioliandre_at_[hidden])
Date: 20130701 04:18:02
Dear all Boost users,
I need to count all cliques of a given size in an undirected graph. I
am using Boost Graph and I have found the BronKerbosch algorithm
implemented in version 1.53 but not documented. My question is
twofold:
1) why the algorithm is somehow hidden?
2) Is this algorithm able to count the occurrencies of cliques of a
certain dimension or just the maximal cliques?
Best,
Andrea Cassioli
Boostusers list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net