Modification problems toward proper (Helly) circular-arc graphs

IF 0.8 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Information and Computation Pub Date : 2024-08-05 DOI:10.1016/j.ic.2024.105211

Yixin Cao , Hanchun Yuan , Jianxin Wang

引用次数: 0

Abstract

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. [Computer Science Review 2023]. Our structural study also implies parameterized algorithms for modification problems toward proper Helly circular-arc graphs.

查看原文本刊更多论文

面向适当（赫利）圆弧图的修改问题

我们提出了适当圆弧顶点删除问题的-时间算法，解决了 van 't Hof 和 Villanger [Algorithmica 2013] 以及 Crespelle 等人 [Computer Science Review 2023] 的一个未决问题。我们的结构研究还隐含了针对适当的赫尔利圆弧图的修改问题的参数化算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information and Computation 工程技术-计算机：理论方法

CiteScore

2.30

自引率

0.00%

发文量

119

审稿时长

140 days

期刊介绍： Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as -Biological computation and computational biology- Computational complexity- Computer theorem-proving- Concurrency and distributed process theory- Cryptographic theory- Data base theory- Decision problems in logic- Design and analysis of algorithms- Discrete optimization and mathematical programming- Inductive inference and learning theory- Logic & constraint programming- Program verification & model checking- Probabilistic & Quantum computation- Semantics of programming languages- Symbolic computation, lambda calculus, and rewriting systems- Types and typechecking