The stable set problem and the thinness of a graph (Q2643810): Difference between revisions

@@ Property / OpenAlex ID @@
+W2004317264
@@ Property / OpenAlex ID: W2004317264 / rank @@
+Normal rank
@@ Property / cites work @@
+Models and solution techniques for frequency assignment problems
+Normal rank
@@ Property / cites work @@
+A survey of very large-scale neighborhood search techniques
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for interval graphs and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
+Normal rank
@@ Property / cites work @@
+An optimal greedy heuristic to color interval graphs
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+A unified approach to domination problems on interval graphs
+Normal rank