Modification Problems toward Proper (Helly) Circular-arc Graphs
Data Structures and Algorithms
2022-02-03 v1
Abstract
We present a -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.
Keywords
Cite
@article{arxiv.2202.00854,
title = {Modification Problems toward Proper (Helly) Circular-arc Graphs},
author = {Yixin Cao and Jianxin Wang and Hanchun Yuan},
journal= {arXiv preprint arXiv:2202.00854},
year = {2022}
}