Find all the cliques in a graph
Find all the cliques in a graph
maxClique(g, nodes=NULL, edgeMat=NULL)
g |
an instance of the |
nodes |
vector of node names, to be supplied if |
edgeMat |
2 x p matrix with indices of edges in nodes, one-based, only to be supplied if codeg is not |
Notice the maximum clique problem is NP-complete, which means it cannot be solved by any known polynomial algorithm.
We implemented the algorithm by C. Bron and J. Kerbosch,
It is an error to supply both g and either of the other arguments.
If g is not supplied, no checking of the consistency of
nodes and edgeMat is performed.
maxClique |
list of all cliques in |
Li Long <li.long@isb-sib.ch>
Finding all cliques of an undirected graph, by C. Bron and J. Kerbosch, Communication of ACM, Sept 1973, Vol 16, No. 9.
con1 <- file(system.file("XML/conn.gxl",package="RBGL"), open="r")
coex <- fromGXL(con1)
close(con1)
maxClique(coex)
con2 <- file(system.file("XML/hcs.gxl",package="RBGL"), open="r")
coex <- fromGXL(con2)
close(con2)
maxClique(coex)Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.