EXPECTED BEHAVIORS OF DIJKSTRAS SHORTEST PATH ALGORITHM FOR COMPLETE GRAPHS

被引：4
|
作者：
NOSHITA, K
MASUDA, E
MACHIDA, H
机构：
来源：
INFORMATION PROCESSING LETTERS | 1978年 / 7卷 / 05期
关键词：
D O I：
10.1016/0020-0190(78)90007-8
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：237 / 243
页数：7
相关论文
共 50 条
  • [41] AN ALL PAIRS SHORTEST-PATH ALGORITHM WITH EXPECTED TIME O(N2LOGN)
    MOFFAT, A
    TAKAOKA, T
    SIAM JOURNAL ON COMPUTING, 1987, 16 (06) : 1023 - 1031
  • [42] A Routing Algorithm with Candidate Shortest Path
    潘启敬
    JournalofComputerScienceandTechnology, 1986, (03) : 33 - 52
  • [43] An Improved Multiobjective Shortest Path Algorithm
    de las Casas, Pedro Maristany
    Sedeno-Noda, Antonio
    Borndoerfer, Ralf
    COMPUTERS & OPERATIONS RESEARCH, 2021, 135
  • [44] A multiple pairs shortest path algorithm
    Wang, IL
    Johnson, EL
    Sokol, JS
    TRANSPORTATION SCIENCE, 2005, 39 (04) : 465 - 476
  • [45] A novel shortest path query algorithm
    Chen, Wei
    Chen, Ziyang
    Liu, Jia
    Yang, Qingzhang
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 3): : S6729 - S6740
  • [46] The FastMap Algorithm for Shortest Path Computations
    Cohen, Liron
    Uras, Tansel
    Jahangiri, Shiva
    Arunasalam, Aliyah
    Koenig, Sven
    Kumar, T. K. Satish
    PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 1427 - 1433
  • [47] An Algorithm to Find K Shortest Path
    Sun, Gangming
    Wang, Pin
    2013 INTERNATIONAL CONFERENCE ON ECONOMIC, BUSINESS MANAGEMENT AND EDUCATION INNOVATION (EBMEI 2013), VOL 18, 2013, 18 : 208 - 214
  • [48] Dynamic stochastic shortest path algorithm
    Zhang Shui-Jian
    Liu Xue-Jun
    Yang Yang
    ACTA PHYSICA SINICA, 2012, 61 (16)
  • [49] ALGORITHM-97 - SHORTEST PATH
    FLOYD, RW
    COMMUNICATIONS OF THE ACM, 1962, 5 (06) : 345 - 345
  • [50] Δ-stepping:: a parallelizable shortest path algorithm
    Meyer, U
    Sanders, P
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2003, 49 (01): : 114 - 152
12345