An all-pairs shortest path algorithm for bipartite graphs

被引：2
|
作者：
Torgasin, Svetlana [1 ]
Zimmermann, Karl-Heinz [1 ]
机构：
[1] Hamburg Univ Technol, D-21071 Hamburg, Germany
来源：
OPEN COMPUTER SCIENCE | 2013年 / 3卷 / 04期
关键词：
bipartite graph; tropical (min-plus) algebra; shortest path; distance matrix product;
D O I：
10.2478/s13537-013-0110-4
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Bipartite graphs are widely used for modeling of complex structures in biology, engineering, and computer science. The search for shortest paths in such structures is a highly demanded procedure that requires optimization. This paper presents a variant of the all-pairs shortest path algorithm for bipartite graphs. The method is based on the distance matrix product and improves the general algorithm by exploiting the graph topology. The space complexity is reduced by a factor of at least four and the time complexity decreased by almost an order of magnitude when compared with the basic APSP algorithm.
引用
收藏
页码：149 / 157
页数：9
相关论文
共 50 条
  • [1] Accelerating all-pairs shortest path algorithms for bipartite graphs on graphics processing units
    Hanif, Muhammad Kashif
    Zimmermann, Karl-Heinz
    Anees, Asad
    MULTIMEDIA TOOLS AND APPLICATIONS, 2022, 81 (07) : 9549 - 9566
  • [2] Accelerating all-pairs shortest path algorithms for bipartite graphs on graphics processing units
    Muhammad Kashif Hanif
    Karl-Heinz Zimmermann
    Asad Anees
    Multimedia Tools and Applications, 2022, 81 : 9549 - 9566
  • [3] A Supernodal All-Pairs Shortest Path Algorithm
    Sao, Piyush
    Kannan, Ramakrishnan
    Gera, Prasun
    Vuduc, Richard
    PROCEEDINGS OF THE 25TH ACM SIGPLAN SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING (PPOPP '20), 2020, : 250 - 261
  • [4] A faster all-pairs shortest path algorithm for real-weighted sparse graphs
    Pettie, S
    AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 85 - 97
  • [5] On the all-pairs shortest-path algorithm of Moffat and Takaoka
    Mehlhorn, K
    Priebe, V
    RANDOM STRUCTURES & ALGORITHMS, 1997, 10 (1-2) : 205 - 220
  • [6] All-pairs shortest paths algorithm for highdimensional sparse graphs
    Urakov, A. R.
    Timeryaev, T., V
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2013, 19 (01): : 84 - 92
  • [7] Communication Avoiding All-Pairs Shortest Paths Algorithm for Sparse Graphs
    Zhu, Lin
    Hua, Qiang-Sheng
    Jin, Hai
    50TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, 2021,
  • [8] A faster algorithm for the all-pairs shortest path problem and its application
    Takaoka, T
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2004, 3106 : 278 - 289
  • [9] An All Pairs Shortest Path Algorithm for Dynamic Graphs
    Alshammari, Muteb
    Rezgui, Abdelmounaam
    INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE, 2020, 15 (01): : 347 - 365
  • [10] 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):
12345