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 条
12345