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

无$P_8$图在多项式时间上的支配诱导匹配

Dominating Induced Matchings for $P_8$-free Graphs in Polynomial Time

Andreas Brandstadt, Raffaele Mosca

摘要:

设$G=(V,E)$是一个有限无向图。边集$E' \subseteq E$是支配诱导匹配(d.i.m.)如果$E$中的每条边都恰好被$E'$的一条边所包围,则在$G$中。支配诱导匹配(DIM)问题要求存在D.I.M.。在$G$中,这个问题也被称为有效边支配问题。DIM问题涉及到并行资源分配问题、编码理论和网络路由。即使对于非常有限的图类(例如最大度为三的平面二分图),它也是NP完全的,并且对于无$P_7$的图,它在线性时间内是可解的。然而,它的复杂性对于任何$k \ge 8$的无$P_k$图是开放的; $P_k$表示具有$k$顶点和$k-1$边的无弦路径.本文证明了无$P_8$图的加权DIM问题在多项式时间内是可解的。

英文摘要:

Let $G=(V,E)$ be a finite undirected graph. An edge set $E' \subseteq E$ is a dominating induced matching (d.i.m.) in $G$ if every edge in $E$ is intersected by exactly one edge of $E'$. The Dominating Induced Matching (DIM) problem asks for the existence of a d.i.m. in $G$; this problem is also known as the Efficient Edge Domination problem. The DIM problem is related to parallel resource allocation problems, encoding theory and network routing. It is NP-complete even for very restricted graph classes such as planar bipartite graphs with maximum degree three and is solvable in linear time for $P_7$-free graphs. However, its complexity was open for $P_k$-free graphs for any $k \ge 8$; $P_k$ denotes the chordless path with $k$ vertices and $k-1$ edges. We show in this paper that the weighted DIM problem is solvable in polynomial time for $P_8$-free graphs.

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

↑