The struction algorithm for the maximum stable set problem revisited (Q1332429): Difference between revisions

@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Q5615282
@@ Property / cites work: Q5615282 / rank @@
+Normal rank
@@ Property / cites work @@
+The basic algorithm for pseudo-Boolean programming revisited
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3682509
@@ Property / cites work: Q3682509 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4093489
@@ Property / cites work: Q4093489 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+The struction of a graph: Application to CN-free graphs
+Normal rank
@@ Property / cites work @@
+Stability in CAN-free graphs
@@ Property / cites work: Stability in CAN-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5339894
@@ Property / cites work: Q5339894 / rank @@
+Normal rank