An FPT algorithm for the vertex cover \(P_4\) problem (Q906446): Difference between revisions

@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+On the vertex \(k\)-path cover
@@ Property / cites work: On the vertex \(k\)-path cover / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum \(k\)-path vertex cover
@@ Property / cites work: Minimum \(k\)-path vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+On the weighted \(k\)-path vertex cover problem
@@ Property / cites work: On the weighted \(k\)-path vertex cover problem / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+Improved algorithms for feedback vertex set problems
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
+Normal rank
@@ Property / cites work @@
+Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for cluster vertex deletion
+Normal rank
@@ Property / cites work @@
+On the \(k\)-path vertex cover of some graph products
+Normal rank
@@ Property / cites work @@
+Another disjoint compression algorithm for odd cycle transversal
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+A 2-approximation algorithm for the vertex cover<i>P</i><sub>4</sub>problem in cubic graphs
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding odd cycle transversals.
@@ Property / cites work: Finding odd cycle transversals. / rank @@
+Normal rank
@@ Property / cites work @@
+A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
+Normal rank