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

在多项式时间内寻找无$(S_{2,2,3})$图的支配诱导匹配

Finding Dominating Induced Matchings in $(S_{2,2,3})$-Free Graphs in Polynomial Time

Andreas Brandstädt, Raffaele Mosca

摘要:

设$G=(V,E)$是一个有限无向图。边集$E' \subseteq E$是{ \em支配诱导匹配}({ \em d.i.m.})在$G$中,如果$E$中的每条边都恰好被$E'$的一条边包围。\emph{Dominating Induced Matching}(\emph{DIM})问题要求存在d.i.m.\在$G$中;这个问题也被称为\emph{Efficient Edge Domination}问题;它是线图的有效控制问题。DIM问题是\NP -完全的,即使是非常有限的图类,如平面二分图与最大程度3,是可解的线性时间为$P_7$ -免费的图,和在多项式时间为$S_{1,2,4}$ -免费的图以及$S_{2,2,2}$ -免费的图。在本文中,结合两种不同的方法,我们解决了它在多项式时间的$S_{2,2,3}$ -自由图。

英文摘要:

Let $G=(V,E)$ be a finite undirected graph. An edge set $E' \subseteq E$ is a {\em dominating induced matching} ({\em d.i.m.}) in $G$ if every edge in $E$ is intersected by exactly one edge of $E'$. The \emph{Dominating Induced Matching} (\emph{DIM}) problem asks for the existence of a d.i.m.\ in $G$; this problem is also known as the \emph{Efficient Edge Domination} problem; it is the Efficient Domination problem for line graphs. The DIM problem is \NP-complete even for very restricted graph classes such as planar bipartite graphs with maximum degree 3 and is solvable in linear time for $P_7$-free graphs, and in polynomial time for $S_{1,2,4}$-free graphs as well as for $S_{2,2,2}$-free graphs. In this paper, combining two distinct approaches, we solve it in polynomial time for $S_{2,2,3}$-free graphs.

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

↑