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 条

[31] An all-pairs shortest path algorithm for bipartite graphs
Torgasin, Svetlana
Zimmermann, Karl-Heinz
OPEN COMPUTER SCIENCE, 2013, 3 (04) : 149 - 157
[32] A novel algorithm of image enhancement based on Pulse Coupled Neural Network time matrix and Rough Set
Ma, Yide
Lin, Dongmei
Zhang, Beidou
Xia, Chunshui
FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 3, PROCEEDINGS, 2007, : 86 - 90
[33] All Pairs Shortest Paths using bridging sets and rectangular matrix multiplication
Zwick, U
JOURNAL OF THE ACM, 2002, 49 (03) : 289 - 317
[34] A Reoptimization-Based All-Pairs Shortest Path Algorithm for Large-Scale Network-RASP Algorithm
Jiang J.-C.
Wu L.-X.
Zhang Y.-Y.
Liu S.-J.
Dongbei Daxue Xuebao/Journal of Northeastern University, 2017, 38 (07): : 1037 - 1042
[35] Efficient Shortest-Path-Tree Computation in Network Routing Based on Pulse-Coupled Neural Networks
Qu, Hong
Yi, Zhang
Yang, Simon X.
IEEE TRANSACTIONS ON CYBERNETICS, 2013, 43 (03) : 995 - 1010
[36] On the all-pairs-shortest-path problem in unweighted undirected graphs
Seidel, R
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 51 (03) : 400 - 403
[37] On the all-pairs-shortest-path problem in unweighted undirected graphs
Univ of California, Berkeley, Berkeley, United States
J Comput Syst Sci, 3 (400-403):
[38] Original optimal method to solve the all-pairs shortest path problem: Dhouib-matrix-ALL-SPP
Dhouib S.
Data Science and Management, 2024, 7 (03): : 206 - 217
[39] On the all-pairs shortest-path algorithm of Moffat and Takaoka
Mehlhorn, K
Priebe, V
RANDOM STRUCTURES & ALGORITHMS, 1997, 10 (1-2) : 205 - 220
[40] A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network
Wang, Rong-Long
Guo, Shan-Shan
Okazaki, Kozo
SOFT COMPUTING, 2009, 13 (06) : 551 - 558

← 1 2 3 4 5 →