Exploiting c-closure in kernelization algorithms for graph problems

被引:0
|
作者
Koana, Tomohiro [1 ]
Komusiewicz, Christian [2 ]
Sommer, Frank [2 ]
机构
[1] Technische Universität Berlin, Algorithmics and Computational Complexity, Germany
[2] Philipps-Universität Marburg, Fachbereich Mathematik und Informatik, Germany
关键词
Dominating sets - Graph G - Graph problems - Induced matchings - Kernelization - Ramsey numbers;
D O I
暂无
中图分类号
学科分类号
摘要
31
引用
收藏
相关论文
共 50 条
  • [1] EXPLOITING c-CLOSURE IN KERNELIZATION ALGORITHMS FOR GRAPH PROBLEMS*
    Koana, Tomohiro
    Komusiewicz, Christian
    Sommer, Frank
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (04) : 2798 - 2821
  • [2] FURTHER EXPLOITING c-CLOSURE FOR FPT ALGORITHMS AND KERNELS FOR DOMINATION PROBLEMS
    Kanesh, Lawqueen
    Madathil, Jayakrishnan
    Roy, Sanjukta
    Sahu, Abhishek
    Saurabh, Saket
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (04) : 2626 - 2669
  • [3] Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
    Kanesh, Lawqueen
    Madathil, Jayakrishnan
    Roy, Sanjukta
    Sahu, Abhishek
    Saurabh, Saket
    [J]. Leibniz International Proceedings in Informatics, LIPIcs, 2022, 219
  • [4] An Overview of Kernelization Algorithms for Graph Modification Problems
    Yunlong Liu
    Jianxin Wang
    Jiong Guo
    [J]. Tsinghua Science and Technology, 2014, 19 (04) : 346 - 357
  • [5] An Overview of Kernelization Algorithms for Graph Modification Problems
    Liu, Yunlong
    Wang, Jianxin
    Guo, Jiong
    [J]. TSINGHUA SCIENCE AND TECHNOLOGY, 2014, 19 (04) : 346 - 357
  • [6] On the kernelization of split graph problems
    Yang, Yongjie
    Shrestha, Yash Raj
    Li, Wenjun
    Guo, Jiong
    [J]. THEORETICAL COMPUTER SCIENCE, 2018, 734 : 72 - 82
  • [7] Kernelization Algorithms for Packing Problems Allowing Overlaps
    Fernau, Henning
    Lopez-Ortiz, Alejandro
    Romero, Jazmin
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2015), 2015, 9076 : 415 - 427
  • [8] Kernelization algorithms for d-hitting set problems
    Abu-Khzam, Faisal N.
    [J]. Algorithms and Data Structures, Proceedings, 2007, 4619 : 434 - 445
  • [9] Checking movable configuration space in C-Closure Object for object caging and handling
    Wang, ZhiDong
    Hirata, Yasuhisa
    Kosuge, Kazuhiro
    [J]. 2005 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND BIOMIMETICS, 2006, : 336 - +
  • [10] GRAPH ALGORITHMS AND COVERING PROBLEMS
    PERL, J
    [J]. COMPUTING, 1974, 13 (02) : 107 - 113