On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-016-9999-6
@@ Property / DOI: 10.1007/s10878-016-9999-6 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-016-9999-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2472778302
@@ Property / OpenAlex ID: W2472778302 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity: exponential speed-up for planar graph problems
+Normal rank
@@ Property / cites work @@
+Fourier meets M\"{o}bius: fast subset convolution
@@ Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Treewidth computations. I: Upper bounds
@@ Property / cites work: Treewidth computations. I: Upper bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / 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 @@
+Kernels for Packing and Covering Problems
@@ Property / cites work: Kernels for Packing and Covering Problems / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+A faster FPT algorithm for 3-path vertex cover
@@ Property / cites work: A faster FPT algorithm for 3-path vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+On computing the minimum 3-path vertex cover and dissociation number of graphs
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+A fixed-parameter algorithm for the vertex cover \(P_3\) problem
+Normal rank
@@ Property / cites work @@
+A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
+Normal rank
@@ Property / cites work @@
+A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion
+Normal rank
@@ Property / DOI @@
+.1007/S10878-016-9999-6
@@ Property / DOI: 10.1007/S10878-016-9999-6 / rank @@
+Normal rank