A 5k-vertex kernel for P2-packing
نویسندگان
چکیده
The P2-packing problem asks whether a graph contains k vertex-disjoint (not necessarily induced) paths each of length two. We continue the study its kernelization algorithms, and develop 5k-vertex kernel.
منابع مشابه
A quadratic kernel for feedback vertex set
We prove that given an undirected graph G on n vertices and an integer k, one can compute in polynomial time in n a graph G′ with at most 5k+k vertices and an integer k′ such that G has a feedback vertex set of size at most k iff G′ has a feedback vertex set of size at most k′. This result improves a previous O(k) kernel of Burrage et al. [6], and a more recent cubic kernel of Bodlaender [3]. T...
متن کاملA Cubic Kernel for Feedback Vertex Set
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, when given a graph G and an integer k, finds a graph H and integer k′ ≤ k, such that H has a feedback vertex set with at most k′ vertices, if and only if G has a feedback vertex set with at most k vertices, and H has a...
متن کاملThe mixed vertex packing problem
We study a generalization of the vertex packing problem having both binary and bounded continuous variables, called the mixed vertex packing problem (MVPP). The well-known vertex packing model arises as a subproblem or relaxation of many 0-1 integer problems, whereas the mixed vertex packing model arises as a natural counterpart of vertex packing in the context of mixed 0-1 integer programming....
متن کاملFeedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
Given a graph G and a parameter k, the Chordal Vertex Deletion (CVD) problem asks whether there exists a subset U ⊆ V (G) of size at most k that hits all induced cycles of size at least 4. The existence of a polynomial kernel for CVD was a well-known open problem in the field of Parameterized Complexity. Recently, Jansen and Pilipczuk resolved this question affirmatively by designing a polynomi...
متن کاملA Nice Class for the Vertex Packing Problem
A class W* of graphs for which the vertex packing problem can be solved in polynomial time is described. Graphs in V* can be obtained from bipartite graphs and claw-free graphs by repeated substitutions. A forbidden subgraphs characterization of the class V‘ is given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2022
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2022.01.032