Approximating maximum independent sets by excluding subgraphs (Q5056088): Difference between revisions

@@ Property / cites work @@
+A note on Ramsey numbers
@@ Property / cites work: A note on Ramsey numbers / rank @@
+Normal rank
@@ Property / cites work @@
+A better performance guarantee for approximate graph coloring
+Normal rank
@@ Property / cites work @@
+On the complexity of approximating the independent set problem
+Normal rank
@@ Property / cites work @@
+Determining the Stability Number of a Graph
@@ Property / cites work: Determining the Stability Number of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5536129
@@ Property / cites work: Q5536129 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5759552
@@ Property / cites work: Q5759552 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5732334
@@ Property / cites work: Q5732334 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Q4065570
@@ Property / cites work: Q4065570 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Shannon capacity of a graph
@@ Property / cites work: On the Shannon capacity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Ramsey numbers and an approximation algorithm for the vertex cover problem
+Normal rank
@@ Property / cites work @@
+Q3481743
@@ Property / cites work: Q3481743 / rank @@
+Normal rank
@@ Property / cites work @@
+Improving the performance guarantee for approximate graph coloring
+Normal rank