On approximation properties of the Independent set problem for degree 3 graphs (Q5057456): Difference between revisions

@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Q3128894
@@ Property / cites work: Q3128894 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128896
@@ Property / cites work: Q3128896 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Greed is good
@@ Property / cites work: Greed is good / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximations of independent sets in bounded-degree graphs
+Normal rank
@@ Property / cites work @@
+Efficient bounds for the stable set, vertex cover and set packing problems
+Normal rank
@@ Property / cites work @@
+Maximum bounded 3-dimensional matching is MAX SNP-complete
+Normal rank
@@ Property / cites work @@
+On Syntactic versus Computational Views of Approximability
+Normal rank
@@ Property / cites work @@
+Three short proofs in graph theory
@@ Property / cites work: Three short proofs in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / DBLP publication ID @@
+conf/wads/BermanF95
@@ Property / DBLP publication ID: conf/wads/BermanF95 / rank @@
+Normal rank