A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically (Q1157909): Difference between revisions

@@ Property / cites work @@
+An Analysis of Some Graph Theoretical Cluster Techniques
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+Clique detection for nondirected graphs: Two new algorithms
+Normal rank
@@ Property / cites work @@
+Maximum internally stable sets of a graph
@@ Property / cites work: Maximum internally stable sets of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Corrections to Bierstone's Algorithm for Generating Cliques
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank