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
Saved in:
| Date: | 2024 |
|---|---|
| Main Authors: | P. Stetsyuk, M. Korablov, O. Stoian, O. Hubernator, O. Mykhailenko |
| Format: | Article |
| Language: | English |
| Published: |
2024
|
| Series: | International Scientific Technical Journal «Problems of Control and Informatics» |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0001501802 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
-
A finding Shortest Paths in a Two-level Graph
by: H. V. Bilyk, et al.
Published: (2014) -
Formulations of problems for k-node shortest path and k-node shortest cycle in a complete graph
by: P. I. Stetsjuk
Published: (2016) -
From Mariya Vyazmitina's diary: a walk to Karadag; a visit to Maksymilian Voloshyn
by: O. Buzko
Published: (2015) -
On the shortest k-node path in a directed graph
by: P. I. Stetsjuk, et al.
Published: (2016) -
Комбінована модель знаходження найкоротшого циклу проходження заданої кількості вершин кластерів графа: приклад застосування для пішохідного туризму
by: Stetsyuk, Petro, et al.
Published: (2024)