A new backtracking algorithm for generating the family of maximal independent sets of a graph (Q786833): Difference between revisions

@@ Property / author @@
-Emmanuel Loukakis
@@ Property / author: Emmanuel Loukakis / rank @@
-Normal rank
@@ Property / author @@
+Emmanuel Loukakis
@@ Property / author: Emmanuel Loukakis / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Algorithm 457
@@ Property / describes a project that uses: Algorithm 457 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0898-1221(83)90115-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2052864165
@@ Property / OpenAlex ID: W2052864165 / rank @@
+Normal rank
@@ Property / cites work @@
+An Analysis of Some Graph Theoretical Cluster Techniques
+Normal rank
@@ Property / cites work @@
+Q3277097
@@ Property / cites work: Q3277097 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4770975
@@ Property / cites work: Q4770975 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4085109
@@ Property / cites work: Q4085109 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for the chromatic number of a graph
@@ Property / cites work: An algorithm for the chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the complexity of the chromatic number problem
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Chromatic Number of a Graph
@@ Property / cites work: An Algorithm for the Chromatic Number of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+The Enumeration of Maximal Cliques of Large Graphs
+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 @@
+Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
+Normal rank
@@ Property / cites work @@
+A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
+Normal rank
@@ Property / cites work @@
+Corrections to Bierstone's Algorithm for Generating Cliques
+Normal rank
@@ Property / cites work @@
+Clique Detection Algorithms Based on Line Addition and Line Removal
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank