A combinatorial column generation algorithm for the maximum stable set problem (Q1374381): Difference between revisions

@@ Property / cites work @@
+Finding a Maximum Clique in an Arbitrary Graph
@@ Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Node-weighted graphs having the König-Egerváry property
+Normal rank
@@ Property / cites work @@
+Q5687249
@@ Property / cites work: Q5687249 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3315557
@@ Property / cites work: Q3315557 / rank @@
+Normal rank
@@ Property / cites work @@
+König-Egerváry graphs, 2-bicritical graphs and fractional matchings
+Normal rank
@@ Property / cites work @@
+Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Independence numbers of graphs - an extension of the Koenig-Egervary theorem
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Q5687257
@@ Property / cites work: Q5687257 / rank @@
+Normal rank