Modeling of Graphs with Different Types of Reachability in Python

Autores: Antonova V.M.¹^,2, Zakhir B.M.¹, Kuznetsov N.A.²
Afiliações:
1. Bauman Moscow State Technical University
2. Kotelnikov Institute of Radio Engineering and Electronics, Russian Academy of Sciences
Edição: Volume 64, Nº 12 (2019)
Páginas: 1464-1472
Seção: Mathematical Models and Computational Methods
URL: https://journals.rcsi.science/1064-2269/article/view/201703
DOI: https://doi.org/10.1134/S1064226919120015
ID: 201703

Citar

Texto integral

Acesso aberto
Acesso é fechado

Acesso está concedido
Acesso é fechado

Somente assinantes

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

Autor responsável pela correspondência
Email: xarti@mail.ru
Rússia, Moscow, 105005; Moscow, 125009

Bauman Moscow State Technical University

Email: xarti@mail.ru
Rússia, Moscow, 105005

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

Email: xarti@mail.ru
Rússia, Moscow, 125009

Ação

1. JATS XML