A New Algorithm for Generating All the Maximal Independent Sets

摘要: The problem of generating all the maximal independent sets (or cliques) a given graph is fundamental in theory and also one most important terms application theory. In this paper, we present new efficient algorithm for sets, which processing time memory space are bounded by $O(nm\mu)$ $O(n+m)$, respectively, where n, m, $\mu$ numbers vertices, edges, graph.