The complexity of cluster vertex splitting and company

被引：0
|
作者：
TU Wien, Vienna, Austria [1 ]
机构：
来源：
Discrete Appl Math | 2025年 / 365卷
关键词：
Supported by the Vienna Science and Technology Fund (WWTF); Austria under grant 10.47379/ICT22029.Supported by the Vienna Science and Technology Fund (WWTF); Austria under grant 10.47379/ICT19035.Partly supported by the Alexander von Humboldt Foundation;
D O I：
10.1016/j.dam.2025.01.012
中图分类号：
学科分类号：
摘要：
44
引用
收藏
页码：190 / 207
相关论文
共 50 条
  • [1] The Complexity of Cluster Vertex Splitting and Company
    Firbas, Alexander
    Dobler, Alexander
    Holzer, Fabian
    Schafellner, Jakob
    Sorge, Manuel
    Villedieu, Anaïs
    Wißmann, Monika
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2024, 14519 LNCS : 226 - 239
  • [2] The Complexity of Cluster Vertex Splitting and Company
    Firbas, Alexander
    Dobler, Alexander
    Holzer, Fabian
    Schafellner, Jakob
    Sorge, Manuel
    Villedieu, Anais
    Wissmann, Monika
    SOFSEM 2024: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2024, 14519 : 226 - 239
  • [3] Cluster Editing with Vertex Splitting
    Abu-Khzam, Faisal N.
    Egan, Judith
    Gaspers, Serge
    Shaw, Alexis
    Shaw, Peter
    COMBINATORIAL OPTIMIZATION, ISCO 2018, 2018, 10856 : 1 - 13
  • [4] Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1
    Baumann, Jakob
    Pfretzschner, Matthias
    Rutter, Ignaz
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2023, 2023, 14093 : 30 - 43
  • [5] Parameterized complexity of vertex splitting to pathwidth at most 1
    Baumann, Jakob
    Pfretzschner, Matthias
    Rutter, Ignaz
    Theoretical Computer Science, 2024, 1021
  • [6] On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
    Firbas, Alexander
    Sorge, Manuel
    Leibniz International Proceedings in Informatics, LIPIcs, 322
  • [7] Algorithms and Complexity of s-Club Cluster Vertex Deletion
    Chakraborty, Dibyayan
    Chandran, L. Sunil
    Padinhatteeri, Sajith
    Pillai, Raji R.
    COMBINATORIAL ALGORITHMS, IWOCA 2021, 2021, 12757 : 152 - 164
  • [8] Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
    Le, Hoang-Oanh
    Le, Van Bang
    THEORY OF COMPUTING SYSTEMS, 2024, 68 (02) : 250 - 270
  • [9] Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
    Hoang-Oanh Le
    Van Bang Le
    Theory of Computing Systems, 2024, 68 : 250 - 270
  • [10] ON THE ZONE COMPLEXITY OF A VERTEX
    Zerbib, Shira
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (02) : 719 - 730
12345