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

求k-无界Hamilton圈的下界

Finding a Lower Bound for k-Unbounded Hamiltonian Cycles

Albert R. Jiang

摘要:

判定图中Hamilton圈存在性的方法已经得到了广泛的研究。然而,很少有研究做了以下情况下,不存在哈密顿循环。设一条路径上的一个顶点被多次访问,则该顶点是“无界的”。此外,设一个k-无界Hamilton圈是一条长度有限的路径,该路径访问每个顶点,有相邻的起始点和结束点,并且包含k个无界顶点。我们考虑一个新的变种的Hamilton圈问题,其中的目标是找到一个m-无界Hamilton圈,其中m是最小值的k,这样一个k-无界Hamilton圈存在。我们首先考虑著名的非哈密顿图的任务。然后,我们提供了一个指数时间的蛮力算法的确定的m-无界的哈密尔顿圈和讨论的方法来解决的变化,通过变换的哈密尔顿圈问题和不对称的旅行商问题。最后,我们提出了一个多项式时间的启发式的确定一个m-无界的哈密顿循环,也被证明是一个有效的启发式的原始哈密顿循环问题。

英文摘要:

Methods to determine the existence of Hamiltonian Cycles in graphs have been extensively studied. However, little research has been done following cases when no Hamiltonian Cycle exists. Let a vertex be "unbounded" if it is visited more than once in a path. Furthermore, let a k-Unbounded Hamiltonian Cycle be a path with finite length that visits every vertex, has adjacent start and end vertices, and contains k unbounded vertices. We consider a novel variant of the Hamiltonian Cycle Problem in which the objective is to find an m-Unbounded Hamiltonian Cycle where m is the minimum value of k such that a k-Unbounded Hamiltonian Cycle exists. We first consider the task on well-known non-Hamiltonian graphs. We then provide an exponential-time brute-force algorithm for the determination of an m-Unbounded Hamiltonian Cycle and discuss approaches to solve the variant through transformations to the Hamiltonian Cycle Problem and the Asymmetric Traveling Salesman Problem. Finally, we present a polynomial-time heuristic for the determination of an m-Unbounded Hamiltonian Cycle that is also shown to be an effective heuristic for the original Hamiltonian Cycle Problem.

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

↑