树中边相交非分裂路径的图:洞的表示(第二部分)
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II
AI总结:
本文研究树中边相交非分裂路径图(ENPT图)中无弦环(洞)的表示,通过放宽先前提出的三个假设,刻画满足(P3)的ENPT洞的表示,给出求解P3-HamiltonianPairRec的多项式时间算法,并证明HamiltonianPairRec除非P=NP否则无多项式算法。
摘要:
给定一棵树以及其上的一组非平凡简单路径P,VPT(P)是路径P的VPT图(即顶点相交图),EPT(P)是P的EPT图(即边相交图)。这些图在文献中已被广泛研究。给定图中两条(边)相交的路径,它们的分裂顶点是其并集中度至少为3的顶点集合。一对(边)相交路径被称为非分裂的,如果它们没有分裂顶点(即它们的并集是一条路径)。我们定义树中边相交非分裂路径的图ENPT(P),称为ENPT图,该图对P中的每条路径有一个顶点,并且每对表示两条既边相交又非分裂的路径的顶点之间有一条边。图G是ENPT图,如果存在一棵树T和T的一组路径P使得G=ENPT(P),并且我们称<T,P>是G的一个表示。\n我们的目标是刻画无弦ENPT环(洞)的表示。为实现此目标,我们首先假设由ENPT洞的顶点诱导的EPT图是给定的。在[2]中,我们引入了定义在EPT、ENPT图对上的三个假设(P1)、(P2)、(P3)。在同一研究中,我们定义了两个问题HamiltonianPairRec、P3-HamiltonianPairRec,并刻画了满足(P1)、(P2)、(P3)的ENPT洞的表示。\n在本工作中,我们通过逐一放宽这三个假设来继续我们的研究。我们通过提供求解P3-HamiltonianPairRec的多项式时间算法,刻画了满足(P3)的ENPT洞的表示。我们还证明了除非P=NP,否则不存在求解HamiltonianPairRec的多项式时间算法。
英文摘要:
Given a tree and a set P of non-trivial simple paths on it, VPT(P) is the VPT graph (i.e. the vertex intersection graph) of the paths P, and EPT(P) is the EPT graph (i.e. the edge intersection graph) of P. These graphs have been extensively studied in the literature. Given two (edge) intersecting paths in a graph, their split vertices is the set of vertices having degree at least 3 in their union. A pair of (edge) intersecting paths is termed non-splitting if they do not have split vertices (namely if their union is a path). We define the graph ENPT(P) of edge intersecting non-splitting paths of a tree, termed the ENPT graph, as the graph having a vertex for each path in P, and an edge between every pair of vertices representing two paths that are both edge-intersecting and non-splitting. A graph G is an ENPT graph if there is a tree T and a set of paths P of T such that G=ENPT(P), and we say that <T,P> is a representation of G. Our goal is to characterize the representation of chordless ENPT cycles (holes). To achieve this goal, we first assume that the EPT graph induced by the vertices of an ENPT hole is given. In [2] we introduce three assumptions (P1), (P2), (P3) defined on EPT, ENPT pairs of graphs. In the same study, we define two problems HamiltonianPairRec, P3-HamiltonianPairRec and characterize the representations of ENPT holes that satisfy (P1), (P2), (P3). In this work, we continue our work by relaxing these three assumptions one by one. We characterize the representations of ENPT holes satisfying (P3) by providing a polynomial-time algorithm to solve P3-HamiltonianPairRec. We also show that there does not exist a polynomial-time algorithm to solve HamiltonianPairRec, unless P=NP.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。