APA (7th ed.) Citation

Kurapov, S., Davidovsky, M., & Polyuga, S. (2024). Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem.

Chicago Style (17th ed.) Citation

Kurapov, Sergey, Maxim Davidovsky, and Svetlana Polyuga. Algorithmic Methods of Finite Discrete Structures. Hamiltonian Cycle of a Complete Graph and the Traveling Salesman Problem. 2024.

MLA (9th ed.) Citation

Kurapov, Sergey, et al. Algorithmic Methods of Finite Discrete Structures. Hamiltonian Cycle of a Complete Graph and the Traveling Salesman Problem. 2024.