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)
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)
by: P. I. Stetsjuk
Published: (2016)
On the shortest k-node path in a directed graph
by: P. I. Stetsjuk, et al.
Published: (2016)
by: P. I. Stetsjuk, et al.
Published: (2016)
From Mariya Vyazmitina's diary: a walk to Karadag; a visit to Maksymilian Voloshyn
by: O. Buzko
Published: (2015)
by: O. Buzko
Published: (2015)
Problems on Shortest k-Node Cycles and Paths
by: P. I. Stetsiuk, et al.
Published: (2021)
by: P. I. Stetsiuk, et al.
Published: (2021)
Algorithm for word segmentation based on the shortest path algorithm inside a graph
by: Lande, D. V., et al.
Published: (2017)
by: Lande, D. V., et al.
Published: (2017)
Algorithm for word segmentation based on the shortest path algorithm inside a graph
by: D. V. Lande, et al.
Published: (2017)
by: D. V. Lande, et al.
Published: (2017)
Maximum independent sets of graph vertices searching for software projects improvement
by: Slabospitska, O.O., et al.
Published: (2023)
by: Slabospitska, O.O., et al.
Published: (2023)
On the Directional Movement of a Graph Walking Automaton without a Compass on Infinite Path Graph
by: S. V. Sapunov
Published: (2017)
by: S. V. Sapunov
Published: (2017)
Finding a given number of solutions to a system of fuzzy constraints
by: M. I. Shlezinger, et al.
Published: (2018)
by: M. I. Shlezinger, et al.
Published: (2018)
Dynamic problem of finding the shortest path with additional conditions for the problem of constructing flight route airplanes
by: L. F. Hulianytskyi, et al.
Published: (2015)
by: L. F. Hulianytskyi, et al.
Published: (2015)
Domination on the vertices of labeled graphs
by: I. Grunsky, et al.
Published: (2012)
by: I. Grunsky, et al.
Published: (2012)
Domination on the vertices of labeled graphs
by: Grunsky, I., et al.
Published: (2012)
by: Grunsky, I., et al.
Published: (2012)
The shortest k-node path
by: P. I. Stetsjuk, et al.
Published: (2015)
by: P. I. Stetsjuk, et al.
Published: (2015)
Bounds for graphs of given girth and generalized polygons
by: Benkherouf, L., et al.
Published: (2002)
by: Benkherouf, L., et al.
Published: (2002)
Selection of the subgraphs of some types from the given graph
by: Khomenko, N. P., et al.
Published: (1966)
by: Khomenko, N. P., et al.
Published: (1966)
Method of managing the execution of tasks of a multithreaded program according to a given dependency graph
by: Terentiev, R.V., et al.
Published: (2024)
by: Terentiev, R.V., et al.
Published: (2024)
Method of managing the execution of tasks of a multithreaded program according to a given dependency graph
by: Nesterenko, K.P., et al.
Published: (2024)
by: Nesterenko, K.P., et al.
Published: (2024)
Visiting craft of Scythian teemers
by: Ya. Olhovskyi
Published: (2012)
by: Ya. Olhovskyi
Published: (2012)
Walking Automata on a Class of Geometric Environments
by: Kurganskyy, O., et al.
Published: (2008)
by: Kurganskyy, O., et al.
Published: (2008)
Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions
by: V. A. Mikhajljuk
Published: (2016)
by: V. A. Mikhajljuk
Published: (2016)
Visiting measures and an ergodic theorem for a sequence of iterations with random perturbations
by: Dorogovtsev, A. A., et al.
Published: (1999)
by: Dorogovtsev, A. A., et al.
Published: (1999)
The visitation protocol of the basilian monastery of Letnia in 1764 year
by: Yu. O. Stetsyk, et al.
Published: (2016)
by: Yu. O. Stetsyk, et al.
Published: (2016)
Synthesis of radiating systems with a flat aperture by the given power pattern directivity. II. Finding the solutions at bifurcation points
by: P. O. Savenko
Published: (2014)
by: P. O. Savenko
Published: (2014)
Cospectral quantum graphs in the case of Dirichlet conditions at pendant vertices
by: V. Pyvovarchyk, et al.
Published: (2023)
by: V. Pyvovarchyk, et al.
Published: (2023)
On unicyclic graphs of metric dimension 2 with vertices of degree 4
by: Dudenko, Marharyta, et al.
Published: (2019)
by: Dudenko, Marharyta, et al.
Published: (2019)
About Structure of Graph Obstructions for Klein Surface with 9 Vertices
by: V. I. Petreniuk, et al.
Published: (2020)
by: V. I. Petreniuk, et al.
Published: (2020)
Cospectral quantum graphs in the case of Dirichlet conditions at pendant vertices
by: Pivovarchik, V., et al.
Published: (2023)
by: Pivovarchik, V., et al.
Published: (2023)
On unicyclic graphs of metric dimension 2 with vertices of degree 4
by: Dudenko, M., et al.
Published: (2018)
by: Dudenko, M., et al.
Published: (2018)
Two-boundary problems for a random walk
by: Yezhov, I. I., et al.
Published: (2007)
by: Yezhov, I. I., et al.
Published: (2007)
An Ambarzumian type theorem on graphs with odd cycles
by: M. Kiss
Published: (2022)
by: M. Kiss
Published: (2022)
An Ambarzumian type theorem on graphs with odd cycles
by: Kiss, M., et al.
Published: (2023)
by: Kiss, M., et al.
Published: (2023)
Overview of methods and algorithms of constructing the shortest paths and prospects of their development
by: A. N. Trofimchuk, et al.
Published: (2020)
by: A. N. Trofimchuk, et al.
Published: (2020)
On the rate of convergence of a regular martingale related to a branching random walk
by: Iksanov, O. M., et al.
Published: (2006)
by: Iksanov, O. M., et al.
Published: (2006)
The method of determining the largest maximal independent sets of vertices of undirected graph
by: S. V. Listrovoj, et al.
Published: (2017)
by: S. V. Listrovoj, et al.
Published: (2017)
Structure 7-vertecses subgraphs 8-vertices graph-obstructions for torus
by: B. I. Petreniuk, et al.
Published: (2017)
by: B. I. Petreniuk, et al.
Published: (2017)
Random walk with resetting in a 1D chain
by: L. M. Khrystoforov
Published: (2020)
by: L. M. Khrystoforov
Published: (2020)
Random Walks in Random Media on a Cayley Tree
by: Rozikov, U. A., et al.
Published: (2001)
by: Rozikov, U. A., et al.
Published: (2001)
Certain properties of a walk on the ergodic Markovian chain
by: Bratijchuk, N. S., et al.
Published: (1987)
by: Bratijchuk, N. S., et al.
Published: (1987)
Continuous Time randon walks with resetting in a bounded chain
by: L. N. Christophorov
Published: (2024)
by: L. N. Christophorov
Published: (2024)
Similar 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) -
On the shortest k-node path in a directed graph
by: P. I. Stetsjuk, et al.
Published: (2016) -
From Mariya Vyazmitina's diary: a walk to Karadag; a visit to Maksymilian Voloshyn
by: O. Buzko
Published: (2015) -
Problems on Shortest k-Node Cycles and Paths
by: P. I. Stetsiuk, et al.
Published: (2021)