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 条

[1] A Novel Algorithm for Shortest Path Problem Based on Pulse Coupled Neural Network
Wu Xueli
Gu Yapei
Zhang Jianhua
2015 27TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2015, : 2468 - 2473
[2] External matrix multiplication and all-pairs shortest path
Sibeyn, JF
INFORMATION PROCESSING LETTERS, 2004, 91 (02) : 99 - 106
[3] A modified pulse coupled neural network for shortest-path problem
Wang, Xiaobin
Qu, Hong
Yi, Zhang
NEUROCOMPUTING, 2009, 72 (13-15) : 3028 - 3033
[4] Solving all-pairs shortest path problem based on amoeba algorithm
2013, ICIC Express Letters Office, Tokai University, Kumamoto Campus, 9-1-1, Toroku, Kumamoto, 862-8652, Japan (07):
[5] ALL-PAIRS SHORTEST PATH MODIFIED MATRIX-MULTIPLICATION BASED ALGORITHM FOR A ONE-CHIP MapReduce ARCHITECTURE
Dragomir, Voichita
UNIVERSITY POLITEHNICA OF BUCHAREST SCIENTIFIC BULLETIN SERIES C-ELECTRICAL ENGINEERING AND COMPUTER SCIENCE, 2016, 78 (04): : 95 - 108
[6] AN EFFICIENT PARALLEL ALGORITHM FOR THE ALL PAIRS SHORTEST-PATH PROBLEM
TAKAOKA, T
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 344 : 276 - 287
[7] 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
[8] On the exponent of the all pairs shortest path problem
Alon, N
Galil, Z
Margalit, O
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1997, 54 (02) : 255 - 262
[9] On the exponent of the all pairs shortest path problem
Tel-Aviv Univ, Tel Aviv, Israel
J Comput Syst Sci, 2 (255-262):
[10] Shortest-path algorithm using adjustable weight pulse-coupled neural network
Du, Hua
Zhou, Dongming
Zhao, Dongfeng
Bai, Yunhong
Lin, Lin
Yi Qi Yi Biao Xue Bao/Chinese Journal of Scientific Instrument, 2007, 28 (SUPPL. 5): : 269 - 273

← 1 2 3 4 5 →