Modeling of Graphs with Different Types of Reachability in Python

Authors: Antonova V.M.¹^,2, Zakhir B.M.¹, Kuznetsov N.A.²
Affiliations:
1. Bauman Moscow State Technical University
2. Kotelnikov Institute of Radio Engineering and Electronics, Russian Academy of Sciences
Issue: Vol 64, No 12 (2019)
Pages: 1464-1472
Section: Mathematical Models and Computational Methods
URL: https://ogarev-online.ru/1064-2269/article/view/201703
DOI: https://doi.org/10.1134/S1064226919120015
ID: 201703

Cite item

Full Text

Open Access
Restricted Access

Access granted
Restricted Access

Subscription Access

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

Author for correspondence.
Email: xarti@mail.ru
Russian Federation, Moscow, 105005; Moscow, 125009

Bauman Moscow State Technical University

Email: xarti@mail.ru
Russian Federation, Moscow, 105005

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

Email: xarti@mail.ru
Russian Federation, Moscow, 125009

Supplementary Files

Action

1. JATS XML