Modification problems toward proper (Helly) circular-arc graphs

被引：0
|
作者：
Cao, Yixin [1 ]
Yuan, Hanchun [2 ]
Wang, Jianxin [2 ]
机构：
[1] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Peoples R China
[2] Cent South Univ, Sch Comp Sci & Engn, Changsha, Peoples R China
来源：
INFORMATION AND COMPUTATION | 2024年 / 301卷
基金：
中国国家自然科学基金;
关键词：
D O I：
10.1016/j.ic.2024.105211
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a 9k <middle dot> nO(1)-time algorithm for the proper circular-arc vertex deletion problem, resolving an open problem of van 't Hof and Villanger [Algorithmica 2013] and Crespelle et al. [Computer Science Review 2023]. Our structural study also implies parameterized algorithms for modification problems toward proper Helly circular-arc graphs. (c) 2024 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
引用
收藏
页数：16
相关论文
共 50 条
  • [21] Solving the canonical representation and Star System Problems for proper circular-arc graphs in logspace
    Koebler, Johannes
    Kuhnert, Sebastian
    Verbitsky, Oleg
    JOURNAL OF DISCRETE ALGORITHMS, 2016, 38-41 : 38 - 49
  • [22] A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
    Soulignac, Francisco J.
    THEORETICAL COMPUTER SCIENCE, 2021, 889 : 105 - 134
  • [23] Helly Circular-Arc Graph Isomorphism Is in Logspace
    Koebler, Johannes
    Kuhnert, Sebastian
    Verbitsky, Oleg
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013, 2013, 8087 : 631 - 642
  • [24] Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs
    Deng, XT
    Hell, P
    Huang, J
    SIAM JOURNAL ON COMPUTING, 1996, 25 (02) : 390 - 403
  • [25] EFFICIENT REDUCTION FOR PATH PROBLEMS ON CIRCULAR-ARC GRAPHS
    ARIKATI, SR
    RANGAN, CP
    MANACHER, GK
    BIT, 1991, 31 (02): : 182 - 193
  • [26] On partitioning interval and circular-arc graphs into proper interval subgraphs with applications
    Gardi, F
    LATIN 2004: THEORETICAL INFORMATICS, 2004, 2976 : 129 - 140
  • [27] Pathwidth of circular-arc graphs
    Suchan, Karol
    Todinca, Ioan
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2007, 4769 : 258 - +
  • [28] TREEWIDTH OF CIRCULAR-ARC GRAPHS
    SUNDARAM, R
    SINGH, KS
    RANGAN, CP
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1994, 7 (04) : 647 - 655
  • [29] TREEWIDTH OF CIRCULAR-ARC GRAPHS
    SUNDARAM, R
    SINGH, KS
    RANGAN, CP
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 519 : 41 - 41
  • [30] IRREDUNDANCY IN CIRCULAR-ARC GRAPHS
    GOLUMBIC, MC
    LASKAR, RC
    DISCRETE APPLIED MATHEMATICS, 1993, 44 (1-3) : 79 - 89
12345