Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion (2401.03415v1)

Published 7 Jan 2024 in cs.DM and math.CO

Abstract: A proper Helly circular-arc graph is an intersection graph of a set of arcs on a circle such that none of the arcs properly contains any other arc and every set of pairwise intersecting arcs has a common intersection. The Proper Helly Circular-arc Vertex Deletion problem takes as input a graph $G$ and an integer $k$, and the goal is to check if we can remove at most $k$ vertices from the graph to obtain a proper Helly circular-arc graph; the parameter is $k$. Recently, Cao et al.~[MFCS 2023] obtained an FPT algorithm for this (and related) problem. In this work, we obtain a polynomial kernel for the problem.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (21)
  1. Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. In (SODA 2017), pages 1383–1398, 2017.
  2. Interval vertex deletion admits a polynomial kernel. In Timothy M. Chan, editor, SODA 2019, San Diego, California, USA, pages 1711–1730. SIAM, 2019.
  3. On problems without polynomial kernels. Journal of Computer and System Sciences, 75(8):423–434, 2009.
  4. Modification Problems Toward Proper (Helly) Circular-Arc Graphs. In Jérôme Leroux, Sylvain Lombardy, and David Peleg, editors, MFCS 2023, volume 272 of LIPIcs, pages 31:1–31:14. Schloss Dagstuhl, 2023.
  5. Parameterized Algorithms. Springer-Verlag, 2015.
  6. Reinhard Diestel. Graph Theory, 4th Edition, volume 173 of Graduate texts in mathematics. Springer, 2012.
  7. Parameterized Complexity. Monographs in Computer Science. Springer, 1999.
  8. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013.
  9. Structural results on circular-arc graphs and circle graphs: a survey and the main open problems. Discrete Applied Mathematics, 164:427–443, 2014.
  10. Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, 2006.
  11. A polynomial kernel for proper interval vertex deletion. SIAM J. Discret. Math., 27(4):1964–1976, 2013.
  12. Martin Charles Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.
  13. Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. Discrete Applied Mathematics, 157(15):3216–3230, 2009.
  14. Unit interval vertex deletion: Fewer vertices are relevant. J. Comput. Syst. Sci., 95:109–121, 2018.
  15. The parameterized complexity of cycle packing: Indifference is not an issue. Algorithmica, 81(9):3803–3841, 2019.
  16. Normal Helly circular-arc graphs and its subclasses. Discret. Appl. Math., 161(7-8):1037–1059, 2013.
  17. Characterizations and recognition of circular-arc graphs and subclasses: A survey. Discrete Mathematics, 309(18):5618–5635, 2009.
  18. Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs. In Danny Z. Chen and D. T. Lee, editors, COCOON 2006, volume 4112 of LNCS, pages 73–82. Springer, 2006.
  19. Dániel Marx. Chordal Deletion is Fixed-Parameter Tractable. Algorithmica, 57(4):747–768, 2010.
  20. Ross M McConnell. Linear-time recognition of circular-arc graphs. Algorithmica, 37(2):93–147, 2003.
  21. Rolf Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now