Clique¶
Functions for finding and manipulating cliques.
Finding the largest clique in a graph is NP-complete problem, so most of these algorithms have an exponential running time; for more information, see the Wikipedia article on the clique problem 1.
- 1
clique problem:: https://en.wikipedia.org/wiki/Clique_problem
Returns all cliques in an undirected graph. |
|
|
Returns all maximal cliques in an undirected graph. |
|
Returns the maximal clique graph of the given graph. |
|
Returns the bipartite clique graph corresponding to |
|
Returns the clique number of the graph. |
|
Returns the number of maximal cliques in the graph. |
|
Returns the size of the largest maximal clique containing each given node. |
|
Returns the number of maximal cliques for each node. |
|
Returns a list of cliques containing the given node. |
|
Find a maximum weight clique in G. |