The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph

被引:0
|
作者
A. V. Smirnov
机构
[1] Demidov Yaroslavl State University,
关键词
multiple graph; divisible graph; multiple path; shortest path; reachability set; polynomial algorithm;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:841 / 853
页数:12
相关论文
共 50 条