Modeling of Graphs with Different Types of Reachability in Python']Python

被引：2

作者：

Antonova, V. M. ^{[1
,2
]}

Zakhir, B. M. ^{[1
]}

Kuznetsov, N. A. ^{[2
]}

机构：

[1] Bauman Moscow State Tech Univ, Moscow 105005, Russia

[2] Russian Acad Sci, Kotelnikov Inst Radio Engn & Elect, Moscow 125009, Russia

来源：

基金：

俄罗斯基础研究基金会;

关键词：

graphs; flows on graphs; magnetic reachability; barrier reachability;

D O I：

10.1134/S1064226919120015

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The objective of this paper was to study different variants of resource networks with different types of reachability constraints.

引用

页码：1464 / 1472

页数：9