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://ogarev-online.ru/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