Modification Problems Toward Proper (Helly) Circular-Arc Graphs

Yixin Cao, Hanchun Yuan, Jianxin Wang

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

1 Citation (Scopus)

Abstract

We present a 9k · 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.

Original languageEnglish
Title of host publication48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023
EditorsJerome Leroux, Sylvain Lombardy, David Peleg
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages1-14
ISBN (Electronic)9783959772921
DOIs
Publication statusPublished - Aug 2023
Event48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023 - Bordeaux, France
Duration: 28 Aug 20231 Sept 2023

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume272
ISSN (Print)1868-8969

Conference

Conference48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023
Country/TerritoryFrance
CityBordeaux
Period28/08/231/09/23

Keywords

  • graph modification problem
  • proper (Helly) circular-arc graph

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Modification Problems Toward Proper (Helly) Circular-Arc Graphs'. Together they form a unique fingerprint.

Cite this