Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem

Sergey Kurapov, Maxim Davidovsky, Svetlana Polyuga

The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is es…