The Enumeration of Maximal Cliques of Large Graphs

An algorithm for enumerating maximal cliques (complete subgraphs) is proposed. The aim is to deal with the difficulties caused by the size of the problem.