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 条
  • [21] A scalable parallelization of all-pairs shortest path algorithm for a high performance cluster environment
    Srinivasan, T.
    Balakrishnan, R.
    Gangadharan, S. A.
    Hayawardh, V
    2007 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, VOLS 1 AND 2, 2007, : 403 - 410
  • [22] DYNAMIC APPROXIMATE ALL-PAIRS SHORTEST PATHS IN UNDIRECTED GRAPHS
    Roditty, Liam
    Zwick, Uri
    SIAM JOURNAL ON COMPUTING, 2012, 41 (03) : 670 - 683
  • [23] Unified all-pairs shortest path algorithms in the chordal hierarchy
    Han, K
    Sekharan, CN
    Sridhar, R
    DISCRETE APPLIED MATHEMATICS, 1997, 77 (01) : 59 - 71
  • [24] A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs
    Lingas, Andrzej
    Sledneu, Dzmitry
    SOFSEM 2012: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2012, 7147 : 373 - +
  • [25] A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs
    Lingas, Andrzej
    Sledneu, Dzmitry
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, 7147 LNCS : 373 - 384
  • [26] Enhanced OpenMP Algorithm to Compute All-Pairs Shortest Path on X86 Architectures
    Calderon, Sergio
    Rucci, Enzo
    Chichizola, Franco
    COMPUTER SCIENCE-CACIC 2023, 2024, 2123 : 46 - 61
  • [27] A Branch-Checking Algorithm for All-Pairs Shortest Paths
    Cees Duin
    Algorithmica , 2005, 41 : 131 - 145
  • [28] The Floyd-Warshall all-pairs shortest paths algorithm for disconnected and very sparse graphs
    Toroslu, Ismail H.
    SOFTWARE-PRACTICE & EXPERIENCE, 2023, 53 (06): : 1287 - 1303
  • [29] 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
  • [30] A branch-checking algorithm for all-pairs shortest paths
    Duin, C
    ALGORITHMICA, 2005, 41 (02) : 131 - 145
12345