由部分图计算完全图同构和Hamilton圈
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones
摘要：
我们证明，计算一对顶点映射到彼此之间的同构$ϕ$两个同构图是很难计算$ϕ$本身。这一结果最佳改善后，结果的Gál等人。我们建立了一个类似的，虽然稍弱，结果计算完全的图从部分哈密尔顿圈。
英文摘要：
We prove that computing a single pair of vertices that are mapped onto each other by an isomorphism $ϕ$ between two isomorphic graphs is as hard as computing $ϕ$ itself. This result optimally improves upon a result of Gál et al. We establish a similar, albeit slightly weaker, result about computing complete Hamiltonian cycles of a graph from partial Hamiltonian cycles.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
