Problems on Shortest k-Node Cycles and Paths
The paper is devoted to the construction of mathematical models for problems on the shortest cycles and paths, that pass through a given number of nodes of a directed graph. Such cycles and paths are called k-node, where 1<k <n, n is the number of nodes in the graph. Section 1 formulates two p...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | article |
| Language: | EN RU UK |
| Published: |
V.M. Glushkov Institute of Cybernetics
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/46a9d8d25fe74c8d9ce9f25291bd18d3 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|