Atomic algorithm and the servers' s use to find the Hamiltonian cycles
Résumé
ABSTRACT:
Inspired by the movement of the particles in the atom, I demonstrated in [5] the existence of a polynomial algorithm of the order for finding Hamiltonian cycles in a graph with basis . 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 : Each point in the graph will be considered as a server, and each server will communicate with each other server with which it is connected . And finally the server will receive and display the Hamiltonian cycles if they exist.