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

线性时间上P7-Free图的支配诱导匹配

Dominating Induced Matchings for P7-Free Graphs in Linear Time

Andreas Brandstadt, Raffaele Mosca

摘要:

设$G$是一个具有边集$E$的有限无向图.如果$G$中的$E'$的边的成对距离至少为2,则边集$E' \subseteq E$是$G$中的{ \em诱导匹配};如果$E'$中的每条边$e \in E \setminus E'$与$E'$中的某条边相交,则$E'$是$G$中的{\em支配}。\emph{Dominating Induced Matching Problem}(简称\emph{DIM})要求存在一个诱导匹配$E'$,它在$G$中也是主导的;这个问题也被称为\emph{Efficient Edge Domination}问题。DIM问题涉及到并行资源分配问题、编码理论和网络路由。它是\NP -完全的,即使是非常有限的图类,如平面二部图的最大程度为3。然而,它的复杂性对于任何$k \ge 5$的$P_k$ -free图是开放的; $P_k$表示具有$k$顶点和$k-1$边的无弦路径.本文证明了无$P_7$图的加权DIM问题在线性时间内是可解的。

英文摘要:

Let $G$ be a finite undirected graph with edge set $E$. An edge set $E' \subseteq E$ is an {\em induced matching} in $G$ if the pairwise distance of the edges of $E'$ in $G$ is at least two; $E'$ is {\em dominating} in $G$ if every edge $e \in E \setminus E'$ intersects some edge in $E'$. The \emph{Dominating Induced Matching Problem} (\emph{DIM}, for short) asks for the existence of an induced matching $E'$ which is also dominating in $G$; this problem is also known as the \emph{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. However, its complexity was open for $P_k$-free graphs for any $k \ge 5$; $P_k$ denotes a chordless path with $k$ vertices and $k-1$ edges. We show in this paper that the weighted DIM problem is solvable in linear time for $P_7$-free graphs in a robust way.

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

↑