AN IMPROVED DISTRIBUTION ALGORITHM FOR SHORTEST PATHS PROBLEM

被引：0
|
作者：
LAKHANI, GD
机构：
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1984年 / 33卷 / 09期
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：855 / 857
页数：3
相关论文
共 50 条
  • [31] Distribution of shortest paths in percolation
    Dokholyan, NV
    Buldyrev, SV
    Havlin, S
    King, PR
    Lee, Y
    Stanley, HE
    PHYSICA A, 1999, 266 (1-4): : 55 - 61
  • [32] Shortest Paths with Shortest DetoursA Biobjective Routing Problem
    Carolin Torchiani
    Jan Ohst
    David Willems
    Stefan Ruzika
    Journal of Optimization Theory and Applications, 2017, 174 : 858 - 874
  • [33] Improved algorithms for dynamic shortest paths
    Djidjev, HN
    Pantziou, GE
    Zaroliagis, CD
    ALGORITHMICA, 2000, 28 (04) : 367 - 389
  • [34] Improved Algorithms for Dynamic Shortest Paths
    H. N. Djidjev
    G. E. Pantziou
    C. D. Zaroliagis
    Algorithmica, 2000, 28 : 367 - 389
  • [35] Improved shortest paths on the word RAM
    Hagerup, T
    AUTOMATA LANGUAGES AND PROGRAMMING, 2000, 1853 : 61 - 72
  • [36] ON AN INSTANCE OF THE INVERSE SHORTEST PATHS PROBLEM
    BURTON, D
    TOINT, PL
    MATHEMATICAL PROGRAMMING, 1992, 53 (01) : 45 - 61
  • [37] A variation of the inverse shortest paths problem
    2001, Wuhan University of Technology (23):
  • [38] The shortest path problem with forbidden paths
    Villeneuve, D
    Desaulniers, G
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (01) : 97 - 107
  • [39] SCALING ALGORITHMS FOR THE SHORTEST PATHS PROBLEM
    GOLDBERG, AV
    SIAM JOURNAL ON COMPUTING, 1995, 24 (03) : 494 - 504
  • [40] Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
    Bley, Andreas
    NETWORKS, 2007, 50 (01) : 29 - 36
12345