Modeling of Graphs with Different Types of Reachability in Python

Авторы: Antonova V.M.¹^,2, Zakhir B.M.¹, Kuznetsov N.A.²
Учреждения:
1. Bauman Moscow State Technical University
2. 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.

Keywords: graphs, flows on graphs, magnetic reachability, barrier reachability

Bauman Moscow State Technical University; Kotelnikov Institute of Radio Engineering and Electronics, Russian Academy of Sciences

Автор, ответственный за переписку.
Email: xarti@mail.ru
Россия, Moscow, 105005; Moscow, 125009

Bauman Moscow State Technical University

Email: xarti@mail.ru
Россия, Moscow, 105005

Kotelnikov Institute of Radio Engineering and Electronics, Russian Academy of Sciences

Email: xarti@mail.ru
Россия, Moscow, 125009

Доп. файлы

Действие

1. JATS XML