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...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
V.M. Glushkov Institute of Cybernetics
2021-09-01
|
Series: | Кібернетика та комп'ютерні технології |
Subjects: | |
Online Access: | http://cctech.org.ua/13-vertikalnoe-menyu-en/269-abstract-21-3-2-arte |