一个摧毁爪子和钻石的算法

摘要：

在{Claw，Diamond}-Free Edge Deletion问题中，输入是一个图$G$和一个整数$k$，目标是确定是否存在一组大小至多为$k$的边，使得从$G$中删除该组边会得到一个不包含诱导爪或菱形的图。本文给出了求解该问题的一个算法，其运行时间为$O^*(3.562^k)$ .

英文摘要：

In the {Claw,Diamond}-Free Edge Deletion problem the input is a graph $G$ and an integer $k$, and the goal is to decide whether there is a set of edges of size at most $k$ such that removing the edges of the set from $G$ results a graph that does not contain an induced claw or diamond. In this paper we give an algorithm for this problem whose running time is $O^*(3.562^k)$.

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