EXTRACTING OF ALL MAXIMAL CLIQUES: MONOTONE SYSTEM APPROACH
Rein Kuusik · Proceedings of the Estonian Academy of Sciences Engineering · 1995
NP-complicated problems have been described in the graph theory. An example is the extracting of all maximal cliques from a graph. Many algorithms for solving this problem havc been described. However, complexity is linear to the number of maximal cliques. This paper discusses a new approach for extracting all maximal cliques, based on the monotone system theory. The complexity of the presented algorithms is linear to the number of maximal cliques.