A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The certificate is an evidence that can be used to authenticate the correctness of the answer.
A Space-Efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic AlgebraizationAn NP-hard graph problem may be intractable for general graphs but it could be efficiently solvable using dynamic programming for graphs with bounded treewidth. Employing dynamic programming on a......
In our solution, we first construct the geodesic convex hull G of X inside P, and then find simple paths turn only at the points of X for two adjacent vertices in X along the boundary of G which are invisible to each other. After an original Hamiltonian cycle is found, we insert the...
hamiltonian cycle problemmarkov decision processcross-entropy methodIn this paper, we propose a new hybrid algorithm for the Hamiltonian cycle problem by synthesizing the Cross Entropy method and Markov decision processes. In particular, this new algorithm assigns a random length to each arc and ...
It is also proved that finding an NC algorithm for perfect matching in slightly less dense graphs is as hard as the same problem for all graphs, and the problem of finding a Hamiltonian cycle becomes NP-complete.doi:10.1109/sfcs.1988.21936Dahlhaus...
Combined, these results show that the algorithms in Sther and Telle (2016) for Edge Dominating Set, Chromatic Number and Max Cut all can be improved. In fact, using our new approximation algorithm, under the Exponential Time Hypothesis, the Hamiltonian Cycle algorithm of this paper, and the ...
Hamiltonian cycle problemadiabatic quantum computationWe put forward an alternative quantum algorithm for finding Hamiltonian cycles in any N-vertex graph based on adiabatic quantum computing. With a von Neumann measurement on the final state, one may determine whether there is a Hamiltonian cycle in ...
This paper studies the protection with Hamiltonian Cycle in mesh survivable backbone networks, and proposes a new heuristic routing algorithm called Enhanced Hamiltonian Cycle Protection (EHCP) to tolerate single failure. Simulation results show that, compared with conventional HCP algorithm, EHCP can ...
A multi-objective Hamiltonian cycle problem is addressed here by computing a Pareto set of solutions that minimize the sum of the weights of the arcs for each objective. Our heuristic approach extends the Branch-and-Fix algorithm, an exact method that embeds the problem in a stochastic process....
An Alternative Adiabatic Quantum Algorithm for the Hamiltonian Cycle Problem量子算法 非绝热 循环问题 哈密顿 量子计算 周期 诺伊曼 鲁棒性张大剑Department of Physics, Shandong University, Jinan 250100, Chinavip理论物理通讯(英文版)