Stetsyuk, P., Korablov, M., Stoian, O., Hubernator, O., & Mykhailenko, O. (2024). A combined model for finding the shortest cycle to visit a given number of vertices from the graph clusters: An example of application for walking tourism.
Chicago-Zitierstil (17. Ausg.)Stetsyuk, P., M. Korablov, O. Stoian, O. Hubernator, und O. Mykhailenko. A Combined Model for Finding the Shortest Cycle to Visit a Given Number of Vertices from the Graph Clusters: An Example of Application for Walking Tourism. 2024.
MLA-Zitierstil (8. Ausg.)Stetsyuk, P., et al. A Combined Model for Finding the Shortest Cycle to Visit a Given Number of Vertices from the Graph Clusters: An Example of Application for Walking Tourism. 2024.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.