A Shortest Path Algorithm for Multi-stage Network with Linear Parameter

被引:0
作者
GAO Taiping WANG Chuanlong YANG AiminDepartment of Computer Science University of Shanxi Taiyuan ChinaDepartment of Mathematics Normal College of Shanxi University Taiyuan ChinaDepartment of Mathematics University of Shanxi Taiyuan China [1 ,2 ,31 ,30006 ,2 ,30012 ,3 ,30006 ]
机构
关键词
the shortest path algorithm; multi-stage network; linear parameter;
D O I
暂无
中图分类号
O224 [最优化的数学理论];
学科分类号
070105 ; 1201 ;
摘要
In this paper, we give the shortest path algorithm for multi-stage network with a linear parameter, and study its complexity.
引用
收藏
页码:341 / 344
页数:4
相关论文
共 1 条
[1]  
A note on two problems in connexion with graphs[J] . E. W. Dijkstra.Numerische Mathematik . 1959 (1)