A faster algorithm for the all-pairs shortest path problem and its application

被引：0
|
作者：
Takaoka, T [1 ]
机构：
[1] Univ Canterbury, Dept Comp Sci, Christchurch 1, New Zealand
来源：
COMPUTING AND COMBINATORICS, PROCEEDINGS | 2004年 / 3106卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We design a faster algorithm for the all-pairs shortest path problem under the RAM model, based on distance matrix multiplication (DMM). Specifically we improve the best known time complexity of 0(n(3) (log log n/log n)(1/2)) to T(n) = 0(n(3) (log log n)(2)/ log n). We extend the algorithm to a parallel algorithm for DMM, whose time complexity is 0(log n) and number of processors is T(n)/ log n. As an application, we show how to speed up the algorithm for the maximum subarray problem.
引用
收藏
页码：278 / 289
页数：12
相关论文
共 50 条
  • [1] A Supernodal All-Pairs Shortest Path Algorithm
    Sao, Piyush
    Kannan, Ramakrishnan
    Gera, Prasun
    Vuduc, Richard
    [J]. PROCEEDINGS OF THE 25TH ACM SIGPLAN SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING (PPOPP '20), 2020, : 250 - 261
  • [2] NOTE ON SPIRAS ALGORITHM FOR ALL-PAIRS SHORTEST-PATH PROBLEM
    CARSON, JS
    LAW, AM
    [J]. SIAM JOURNAL ON COMPUTING, 1977, 6 (04) : 696 - 699
  • [3] Solving all-pairs shortest path problem based on amoeba algorithm
    [J]. 2013, ICIC Express Letters Office, Tokai University, Kumamoto Campus, 9-1-1, Toroku, Kumamoto, 862-8652, Japan (07):
  • [4] A faster all-pairs shortest path algorithm for real-weighted sparse graphs
    Pettie, S
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 85 - 97
  • [5] An all-pairs shortest path algorithm for bipartite graphs
    Torgasin, Svetlana
    Zimmermann, Karl-Heinz
    [J]. OPEN COMPUTER SCIENCE, 2013, 3 (04) : 149 - 157
  • [6] FAST PARALLEL ALGORITHM FOR ALL-PAIRS SHORTEST-PATH PROBLEM AND ITS VLSI IMPLEMENTATION
    DEY, S
    SRIMANI, PK
    [J]. IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1989, 136 (02): : 85 - 89
  • [7] On the all-pairs shortest-path algorithm of Moffat and Takaoka
    Mehlhorn, K
    Priebe, V
    [J]. RANDOM STRUCTURES & ALGORITHMS, 1997, 10 (1-2) : 205 - 220
  • [8] More effective crossover operators for the all-pairs shortest path problem
    Doerr, Benjamin
    Johannsen, Daniel
    Koetzing, Timo
    Neumann, Frank
    Theile, Madeleine
    [J]. THEORETICAL COMPUTER SCIENCE, 2013, 471 : 12 - 26
  • [9] A simple O(n(2)) algorithm for the all-pairs shortest path problem on an interval graph
    Mirchandani, P
    [J]. NETWORKS, 1996, 27 (03) : 215 - 217
  • [10] Solving the Nearly Symmetric All-Pairs Shortest-Path Problem
    Brown, Gerald G.
    Carlyle, W. Matthew
    [J]. INFORMS JOURNAL ON COMPUTING, 2020, 32 (02) : 279 - 288
12345