A novel algorithm for all pairs shortest path problem based on matrix multiplication and pulse coupled neural network

被引：46

作者：

Zhang, Yudong ^{[1
]}

Wu, Lenan ^{[1
]}

Wei, Geng ^{[1
]}

Wang, Shuihua ^{[1
]}

机构：

[1] Southeast Univ, Sch Informat Sci & Engn, Nanjing, Peoples R China

来源：

DIGITAL SIGNAL PROCESSING | 2011年 / 21卷 / 04期

关键词：

All pairs shortest path; Pulse coupled neural network; Matrix multiplication; Parallel algorithm; PCNNS;

D O I：

10.1016/j.dsp.2011.02.004

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

All pairs shortest path (APSP) is a classical problem with diverse applications. Traditional algorithms are not suitable for real time applications, so it is necessary to investigate parallel algorithms. This paper presents an improved matrix multiplication method to solve the APSO problem. Afterwards, the pulse coupled neural network (PCNN) is employed to realize the parallel computation. The time complexity of our strategy is only O (log(2) n), where n stands for the number of nodes. It is the fastest parallel algorithm compared to traditional PCNN, MOPCNN, and MPCNN methods. (C) 2011 Elsevier Inc. All rights reserved.

引用

页码：517 / 521

页数：5

共 50 条

[21] SHORTEST-PATH PROBLEM IS NOT HARDER THAN MATRIX MULTIPLICATION
ROMANI, F
INFORMATION PROCESSING LETTERS, 1980, 11 (03) : 134 - 136
[22] IS SHORTEST-PATH PROBLEM NOT HARDER THAN MATRIX MULTIPLICATION
MORAN, S
INFORMATION PROCESSING LETTERS, 1981, 13 (02) : 85 - 86
[23] THE BIT-OPERATION COMPLEXITY OF MATRIX MULTIPLICATION AND OF ALL PAIR SHORTEST-PATH PROBLEM
PAN, VY
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1981, 7 (05) : 431 - 438
[24] A novel approach for solving all-pairs shortest path problem in an interval-valued fuzzy network
Enayattabr, M.
Ebrahimnejad, A.
Motameni, H.
Garg, H.
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2019, 37 (05) : 6865 - 6877
[25] Parallel All-Pairs Shortest Path Algorithm: Network-Decomposition Approach
Abdelghany, Khaled
Hashemi, Hossein
Alnawaiseh, Ala
TRANSPORTATION RESEARCH RECORD, 2016, (2567) : 95 - 104
[26] Subcubic Cost Algorithms for the All Pairs Shortest Path Problem
T. Takaoka
Algorithmica, 1998, 20 : 309 - 318
[27] Shortest Path Routing Algorithm Based on Chaotic Neural Network
Hu Shiyu & Xie Jianying Automation Research Institute
Journal of Systems Engineering and Electronics, 2003, (04) : 1 - 6
[28] A PRIORITY QUEUE FOR THE ALL PAIRS SHORTEST-PATH PROBLEM
MOFFAT, A
TAKAOKA, T
INFORMATION PROCESSING LETTERS, 1984, 18 (04) : 189 - 193
[29] Subcubic cost algorithms for the all pairs shortest path problem
Takaoka, T
ALGORITHMICA, 1998, 20 (03) : 309 - 318
[30] GPU Implementation of All Pairs Shortest Path Algorithm for Graphs Using Triangular Matrix Method
Umamaheswari, S.
Abisheik, G.
2016 EIGHTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING (ICOAC), 2017, : 218 - 223

← 1 2 3 4 5 →