Skip to main content
SpringerLink
Log in

Improved kernels for triangle packing in tournaments

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bafna V, Pevzner P A. Genome rearrangements and sorting by reversals. SIAM J Comput, 1996, 25: 272–289

    Article  MathSciNet  MATH  Google Scholar 

  2. El-Mabrouk N. Genome rearrangement by reversals and insertions/deletions of contiguous segments. In: Combinatorial Pattern Matching. Berlin: Springer, 2000. 222–234

    Chapter  Google Scholar 

  3. Shao M F, Lin Y, Moret B. An exact algorithm to compute the DCJ distance for genomes with duplicate genes. In: Research in Computational Molecular Biology. Cham: Springer, 2014. 280–292

    Chapter  Google Scholar 

  4. Bodlaender H L, Thomassé S, Yeo A. Kernel bounds for disjoint cycles and disjoint paths. Theor Comput Sci, 2011, 412: 4570–4578

    Article  MathSciNet  MATH  Google Scholar 

  5. Caprara A, Panconesi A, Rizzi R. Packing cycles in undirected graphs. J Algorithms, 2003, 48: 239–256

    Article  MathSciNet  MATH  Google Scholar 

  6. Fomin F V, Lokshtanov D, Misra N, et al. Quadratic upper bounds on the Erdős-Pósa property for a generalization of packing and covering cycles. J Graph Theor, 2013, 74: 417–424

    Article  MATH  Google Scholar 

  7. Krivelevich M, Nutov Z, Salavatipour M R, et al. Approximation algorithms and hardness results for cycle packing problems. ACM Trans Algorithms, 2007, 3: 48

    Article  MathSciNet  MATH  Google Scholar 

  8. Slivkins A. Parameterized tractability of edge-disjoint paths on directed acyclic graphs. SIAM J Discrete Math, 2010, 24: 146–157

    Article  MathSciNet  MATH  Google Scholar 

  9. Holyer I. The NP-completeness of some edge-partition problems. SIAM J Comput, 1981, 10: 713–717

    Article  MathSciNet  MATH  Google Scholar 

  10. Caprara A, Rizzi R. Packing triangles in bounded degree graphs. Inf Processing Lett, 2002, 84: 175–180

    Article  MathSciNet  MATH  Google Scholar 

  11. Kann V. Maximum bounded 3-dimensional matching is MAX SNP-complete. Inf Processing Lett, 1991, 37: 27–35

    Article  MathSciNet  MATH  Google Scholar 

  12. Chlebík M, Chlebíková J. Approximation hardness for small occurrence instances of np-hard problems. In: Proceedings of the 5th Italian Conference on Algorithms and Complexity. Berlin: Springer, 2003. 152–164

    Chapter  MATH  Google Scholar 

  13. Chen J, Kanj I A. Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. J Comput Syst Sci, 2003, 67: 833–847

    Article  MathSciNet  MATH  Google Scholar 

  14. Liu Y L, Chen J, Huang J G. On book thickness parameterized by the vertex cover number. Sci China Inf Sci, 2022, 65: 140603

    Article  Google Scholar 

  15. Wang J X, Li W J, Li S H, et al. On the parameterized vertex cover problem for graphs with perfect matching. Sci China Inf Sci, 2014, 57: 072107

    MathSciNet  MATH  Google Scholar 

  16. Shi F, Wang J X, Yang Y F, et al. A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees. Sci China Inf Sci, 2016, 59: 012102

    Article  Google Scholar 

  17. Cygan M, Fomin F V, Kowalik L, et al. Parameterized Algorithms. Cham: Springer, 2015

    Book  MATH  Google Scholar 

  18. Fomin F V, Lokshtanov D, Saurabh S, et al. Kernelization: Theory of Parameterized Preprocessing. Cambridge: Cambridge University Press, 2019

    MATH  Google Scholar 

  19. Demaine E D, Fomin F V, Hajiaghayi M, et al. Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J ACM, 2005, 52: 866–893

    Article  MathSciNet  MATH  Google Scholar 

  20. Dorn F, Fomin F V, Thilikos D M. Subexponential parameterized algorithms. Comput Sci Rev, 2008, 2: 29–39

    Article  MATH  Google Scholar 

  21. Fomin F V, Villanger Y. Subexponential parameterized algorithm for minimum fill-in. SIAM J Comput, 2013, 42: 2197–2216

    Article  MathSciNet  MATH  Google Scholar 

  22. Dorn F, Fomin F V, Lokshtanov D, et al. Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Inf Computation, 2013, 233: 60–70

    Article  MathSciNet  MATH  Google Scholar 

  23. Bandyapadhyay S, Lochet W, Lokshtanov D, et al. Subexponential parameterized algorithms for cut and cycle hitting problems on H-minor-free graphs. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022. 2063–2084

  24. Lokshtanov D, Panolan F, Saurabh S, et al. Subexponential parameterized algorithms on disk graphs. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022. 2005–2031

  25. Marx D, Misra P, Neuen D, et al. A framework for parameterized subexponential algorithms for generalized cycle hitting problems on planar graphs. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022. 2085–2127

  26. Fan W F, He K, Li Q, et al. Graph algorithms: parallelization and scalability. Sci China Inf Sci, 2020, 63: 203101

    Article  MathSciNet  Google Scholar 

  27. Mathieson L, Prieto-Rodriguez E, Shaw P. Packing edge disjoint triangles: A parameterized view. In: Proceedings of the 1st International Workshop on Parameterized and Exact Computation. Bergen: Springer, 2004. 127–137

    Chapter  Google Scholar 

  28. Yang Y J. Towards optimal kernel for edge-disjoint triangle packing. Inf Processing Lett, 2014, 114: 344–348

    Article  MathSciNet  MATH  Google Scholar 

  29. Lin W B, Xiao M Y. A (3+ε)k-vertex kernel for edge-disjoint triangle packing. Inf Processing Lett, 2019, 142: 20–26

    Article  MathSciNet  MATH  Google Scholar 

  30. Fisher D C, Lundgren J R, Merz S K, et al. The domination and competition graphs of a tournament. J Graph Theor, 1998, 29: 103–110

    Article  MathSciNet  MATH  Google Scholar 

  31. Butz M V, Sastry K, Goldberg D E. Strong, stable, and reliable fitness pressure in XCS due to tournament selection. Genet Program Evolvable Mach, 2005, 6: 53–77

    Article  Google Scholar 

  32. Cui G, Wong M L, Lui H K. Machine learning for direct marketing response models: Bayesian networks with evolutionary programming. Manage Sci, 2006, 52: 597–612

    Article  MATH  Google Scholar 

  33. de Jong K A, Schultz A C. Using experience-based learning in game playing. In: Proceedings of the 5th International Conference on Machine Learning, Ann Arbor, 1988. 284–290

  34. Dudek G. Tournament searching method to feature selection problem. In: Proceedings of the 10th International Conference on Artifical Intelligence and Soft Computing, Zakopane, 2010. 437–444

  35. Bessy S, Bougeret M, Krithika R, et al. Packing arc-disjoint cycles in tournaments. Algorithmica, 2021, 83: 1393–1420

    Article  MathSciNet  MATH  Google Scholar 

  36. Bessy S, Bougeret M, Thiebaut J. Triangle packing in (sparse) tournaments: Approximation and kernelization. In: Proceedings of the 25th Annual European Symposium on Algorithms, Vienna, 2017. 1–13

  37. Fomin F V, Le T N, Lokshtanov D, et al. Subquadratic kernels for implicit 3-hitting set and 3-set packing problems. ACM Trans Algorithms, 2019, 15: 1–44

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by National Natural Science Foundation of China (Grant Nos. 62172446, 61872450).

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Central South University, Changsha, 410083, China

    Hanchun Yuan & Qilong Feng

  2. Hunan Provincial Key Lab on Bioinformatics, Central South University, Changsha, 410083, China

    Jianxin Wang

Authors
  1. Hanchun Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qilong Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianxin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qilong Feng.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yuan, H., Feng, Q. & Wang, J. Improved kernels for triangle packing in tournaments. Sci. China Inf. Sci. 66, 152104 (2023). https://doi.org/10.1007/s11432-021-3551-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-021-3551-2

Keywords

Search

Navigation