Improved kernels for triangle packing in tournaments
Guardado en:
| Publicado en: | Science China. Information Sciences vol. 66, no. 5 (May 2023), p. 152104 |
|---|---|
| Autor principal: | |
| Otros Autores: | , |
| Publicado: |
Springer Nature B.V.
|
| Materias: | |
| Acceso en línea: | Citation/Abstract Full Text - PDF |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Resumen: | Triangle packing problem has been paid lots of attention to in the literature. In this paper, we study the kernelization of the triangle packing problem in tournaments. For the parameterized arc-disjoint triangle packing problem in tournaments, we find a maximal arc-disjoint triangle packing with the number of vertices bounded by 2.5k. Based on the relation between the maximal arc-disjoint triangle packing and the vertices outside of the packing, a kernel of size 3.5k for the problem is obtained, improving the previous best one 6k. For the parameterized vertex-disjoint triangle packing problem in sparse tournaments, several new properties between the triangles in maximal vertex-disjoint triangle packing and the arcs in the feedback arc set are presented, which result in a kernel of size 7k for the problem, improving the previous best one of 15k. We also give a 7k vertex kernel for the parameterized feedback vertex set problem in sparse tournaments. The kernelization process presented in this paper for the parameterized arc-disjoint triangle packing can be applied to solve the parameterized arc-disjoint triangle packing problem on other restricted directed graph classes. |
|---|---|
| ISSN: | 1674-733X 1869-1919 |
| DOI: | 10.1007/s11432-021-3551-2 |
| Fuente: | Advanced Technologies & Aerospace Database |