[Boost-users] Counting all cliques of a given size in an undirected graph

Subject: [Boost-users] Counting all cliques of a given size in an undirected graph
From: Andrea Cassioli (cassioliandre_at_[hidden])
Date: 2013-07-01 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 Bron-Kerbosch algorithm
implemented in version 1.53 but not documented. My question is
two-fold:
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