Using critical sets to solve the maximum independent set problem (Q2457270): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2006.07.004
@@ Property / DOI: 10.1016/j.orl.2006.07.004 / rank @@
-Normal rank
@@ Property / cites work @@
+Q4945528
@@ Property / cites work: Q4945528 / rank @@
+Normal rank
@@ Property / cites work @@
+On Finding Critical Independent and Vertex Sets
@@ Property / cites work: On Finding Critical Independent and Vertex Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Notes—On a Selection Problem
@@ Property / cites work: Notes—On a Selection Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4371290
@@ Property / cites work: Q4371290 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Test case generators and computational results for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Q5687246
@@ Property / cites work: Q5687246 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+A Selection Problem of Shared Fixed Costs and Network Flows
+Normal rank
@@ Property / cites work @@
+Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem
+Normal rank
@@ Property / cites work @@
+Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2006.07.004
@@ Property / DOI: 10.1016/J.ORL.2006.07.004 / rank @@
+Normal rank