A PRIORITY QUEUE FOR THE ALL PAIRS SHORTEST-PATH PROBLEM

被引：0

作者：

MOFFAT, A ^{[1
]}

TAKAOKA, T ^{[1
]}

机构：

[1] IBARAKI UNIV,DEPT INFORMAT SCI,HITACHI 316,JAPAN

来源：

INFORMATION PROCESSING LETTERS | 1984年 / 18卷 / 04期

关键词：

D O I：

10.1016/0020-0190(84)90109-1

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：189 / 193

页数：5

共 50 条

[1] AN EFFICIENT PARALLEL ALGORITHM FOR THE ALL PAIRS SHORTEST-PATH PROBLEM
TAKAOKA, T
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 344 : 276 - 287
[2] AN EFFICIENT VLSI ALGORITHM FOR THE ALL PAIRS SHORTEST-PATH PROBLEM
TAKAOKA, T
UMEHARA, K
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1992, 16 (03) : 265 - 270
[3] A NEW UPPER BOUND ON THE COMPLEXITY OF THE ALL PAIRS SHORTEST-PATH PROBLEM
TAKAOKA, T
INFORMATION PROCESSING LETTERS, 1992, 43 (04) : 195 - 199
[4] NOTE ON SPIRAS ALGORITHM FOR ALL-PAIRS SHORTEST-PATH PROBLEM
CARSON, JS
LAW, AM
SIAM JOURNAL ON COMPUTING, 1977, 6 (04) : 696 - 699
[5] Solving the Nearly Symmetric All-Pairs Shortest-Path Problem
Brown, Gerald G.
Carlyle, W. Matthew
INFORMS JOURNAL ON COMPUTING, 2020, 32 (02) : 279 - 288
[6] A SHARPER ANALYSIS OF A PARALLEL ALGORITHM FOR THE ALL PAIRS SHORTEST-PATH PROBLEM
GU, QP
TAKAOKA, T
PARALLEL COMPUTING, 1990, 16 (01) : 61 - 67
[7] SCALABILITY OF PARALLEL ALGORITHMS FOR THE ALL-PAIRS SHORTEST-PATH PROBLEM
KUMAR, V
SINGH, V
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 13 (02) : 124 - 138
[8] A NEW UPPER BOUND ON THE COMPLEXITY OF THE ALL PAIRS SHORTEST-PATH PROBLEM
TAKAOKA, T
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 570 : 209 - 213
[9] On the all-pairs shortest-path algorithm of Moffat and Takaoka
Mehlhorn, K
Priebe, V
RANDOM STRUCTURES & ALGORITHMS, 1997, 10 (1-2) : 205 - 220
[10] FAST PARALLEL ALGORITHM FOR ALL-PAIRS SHORTEST-PATH PROBLEM AND ITS VLSI IMPLEMENTATION
DEY, S
SRIMANI, PK
IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1989, 136 (02): : 85 - 89

← 1 2 3 4 5 →