2000 character limit reached
Modification Problems toward Proper (Helly) Circular-arc Graphs
Published 2 Feb 2022 in cs.DS | (2202.00854v1)
Abstract: We present a $9k\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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
