Modeling of Graphs with Different Types of Reachability in Python
- Авторы: Antonova V.1,2, Zakhir B.1, Kuznetsov N.2
-
Учреждения:
- Bauman Moscow State Technical University
- Kotelnikov Institute of Radio Engineering and Electronics, Russian Academy of Sciences
- Выпуск: Том 64, № 12 (2019)
- Страницы: 1464-1472
- Раздел: Mathematical Models and Computational Methods
- URL: https://journals.rcsi.science/1064-2269/article/view/201703
- DOI: https://doi.org/10.1134/S1064226919120015
- ID: 201703
Цитировать
Аннотация
Abstract—The objective of this paper was to study different variants of resource networks with different types of reachability constraints.
Ключевые слова
Об авторах
V. Antonova
Bauman Moscow State Technical University; Kotelnikov Institute of Radio Engineering and Electronics, Russian Academy of Sciences
Автор, ответственный за переписку.
Email: xarti@mail.ru
Россия, Moscow, 105005; Moscow, 125009
B. Zakhir
Bauman Moscow State Technical University
Email: xarti@mail.ru
Россия, Moscow, 105005
N. Kuznetsov
Kotelnikov Institute of Radio Engineering and Electronics, Russian Academy of Sciences
Email: xarti@mail.ru
Россия, Moscow, 125009