Atomic algorithm and the servers' s use to find the Hamiltonian cycles
Mohamed Sghiar · HAL (Le Centre pour la Communication Scientifique Directe) · 2016
Inspired by the movement of the particles in the atom, I demonstrated in [5] the exsitence of a ploynomial algorithm of the order O(n 3) for finding Hamiltonian cycles in a graph. In this article I will give an improvement in space and in time of the algorithm says : we know that there exist several methods to find the Hamiltonian cycles such as the Monte Carlo method, Dynamic programming, or DNA computing. Unfortunately they are either expensive or slow to execute it. Hence the idea to use multiple servers to solve this problem.