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 条
  • [41] A Heterogeneous Solution to the All-pairs Shortest Path Problem using FPGAs
    Chirila, Mihnea
    D'Alberto, Paolo
    Ting, Hsin-Yu
    Veidenbaum, Alexander
    Nicolau, Alexandru
    PROCEEDINGS OF THE TWENTY THIRD INTERNATIONAL SYMPOSIUM ON QUALITY ELECTRONIC DESIGN (ISQED 2022), 2022, : 108 - 113
  • [42] Solving the Nearly Symmetric All-Pairs Shortest-Path Problem
    Brown, Gerald G.
    Carlyle, W. Matthew
    INFORMS JOURNAL ON COMPUTING, 2020, 32 (02) : 279 - 288
  • [43] An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
    Saha A.
    Pal M.
    Pal T.K.
    Journal of Applied Mathematics and Computing, 2005, 17 (1-2) : 1 - 23
  • [44] A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths
    Chuzhoy, Julia
    Zhang, Ruimin
    PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 1159 - 1172
  • [45] All-Pairs Shortest Paths for Unweighted Undirected Graphs in o(mn) Time
    Chan, Timothy M.
    ACM TRANSACTIONS ON ALGORITHMS, 2012, 8 (04)
  • [46] A Fast Algorithm to Find All-Pairs Shortest Paths in Complex Networks
    Peng, Wei
    Hu, Xiaofeng
    Zhao, Feng
    Su, Jinshu
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, ICCS 2012, 2012, 9 : 557 - 566
  • [47] A DECOMPOSITION ALGORITHM FOR THE ALL-PAIRS SHORTEST-PATH PROBLEM ON MASSIVELY-PARALLEL COMPUTER ARCHITECTURES
    HABBAL, MB
    KOUTSOPOULOS, HN
    LERMAN, SR
    TRANSPORTATION SCIENCE, 1994, 28 (04) : 292 - 308
  • [48] Fast All-Pairs Shortest Paths Algorithm in Large Sparse Graph
    Yang, Shaofeng
    Liu, Xiandong
    Wang, Yunting
    He, Xin
    Tan, Guangming
    PROCEEDINGS OF THE 37TH INTERNATIONAL CONFERENCE ON SUPERCOMPUTING, ACM ICS 2023, 2023, : 277 - 288
  • [49] A new approach to all-pairs shortest paths on real-weighted graphs
    Pettie, S
    THEORETICAL COMPUTER SCIENCE, 2004, 312 (01) : 47 - 74
  • [50] A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs
    Lima A.M.
    da Silva M.V.G.
    Vignatti A.L.
    Journal of Graph Algorithms and Applications, 2023, 27 (07): : 603 - 619
12345