arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.10012cs.DS
收藏

分裂图上删除问题的算法

Algorithms for deletion problems on split graphs

Dekel Tsur

摘要:

在分裂到块顶点删除和分裂到阈值顶点删除问题中,输入是分裂图$G$和整数$k$,并且目标是判定是否存在至多$k$顶点的集合$S$,使得$G-S$分别是块图和$G-S$是阈值图。在本文中,我们给出了这些问题的算法,其运行时间分别为$O^*(2.076^k)$和$O^*(2.733^k)$。

英文摘要:

In the Split to Block Vertex Deletion and Split to Threshold Vertex Deletion problems the input is a split graph $G$ and an integer $k$, and the goal is to decide whether there is a set $S$ of at most $k$ vertices such that $G-S$ is a block graph and $G-S$ is a threshold graph, respectively. In this paper we give algorithms for these problems whose running times are $O^*(2.076^k)$ and $O^*(2.733^k)$, respectively.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑