Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem dlvr.it/TDQTbX
0
0
1
176
0