论文标题
修改问题（helly）圆形弧形图
Modification Problems toward Proper (Helly) Circular-arc Graphs
论文作者
论文摘要
我们提出了一个$ 9^k \ cdot n^{o（1）} $ - 适当的圆形 - arc顶点删除问题的时间算法，解决了Van'T Hof和Villanger [Algorithmica 2013]和Crespelle等人的开放问题。 [Arxiv：2001.06867]。我们的结构研究还意味着针对适当的Helly圆形ARC图的修改问题的参数化算法。
We present a $9^k\cdot n^{O(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. [arXiv:2001.06867]. Our structural study also implies parameterized algorithms for modification problems toward proper Helly circular-arc graphs.
