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 条
  • [41] A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network
    Rong-Long Wang
    Shan-Shan Guo
    Kozo Okazaki
    Soft Computing, 2009, 13 : 551 - 558
  • [42] A novel approach for solving all-pairs shortest path problem in an interval-valued fuzzy network: Suggested modifications
    Bhatia, Tanveen Kaur
    Kumar, Amit
    Appadoo, S.S.
    Journal of Intelligent and Fuzzy Systems, 2021, 41 (06): : 6389 - 6406
  • [43] A novel approach for solving all-pairs shortest path problem in an interval-valued fuzzy network: Suggested modifications
    Bhatia, Tanveen Kaur
    Kumar, Amit
    Appadoo, S. S.
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2021, 41 (06) : 6389 - 6406
  • [44] A simple O(n(2)) algorithm for the all-pairs shortest path problem on an interval graph
    Mirchandani, P
    NETWORKS, 1996, 27 (03) : 215 - 217
  • [45] Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model
    Izumi, Taisuke
    Le Gall, Francois
    PROCEEDINGS OF THE 2019 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '19), 2019, : 84 - 93
  • [46] 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
  • [47] A recurrent neural network for solving the shortest path problem
    Wang, J
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS, 1996, 43 (06): : 482 - 486
  • [48] A new exact algorithm for the shortest path problem: An optimized shortest distance matrix
    Yuan, Huilin
    Hu, Jianlu
    Song, Yufan
    Li, Yanke
    Du, Jie
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 158
  • [49] A new algorithm for the fuzzy shortest path problem in a network
    Wu, Zezhong
    Zheng, Fenghua
    PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT, 2009, : 134 - 140
  • [50] Neural network for shortest path algorithm and its application
    Ma, Chuanshui
    Ruan, Chuangai
    Beijing Youdian Xueyuan Xuebao/Journal of Beijing University of Posts And Telecommunications, 1999, 22 (04): : 9 - 13
12345