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

如何引用文章

全文:

开放存取

##reader.subscriptionAccessGranted##
受限制的访问

订阅存取

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