| [176899] |
| Title: An all-pairs shortest path algorithm for bipartite graphs. |
| Written by: Svetlana Torgasin and Karl-Heinz Zimmermann |
| in: <em>Central European Journal of Computer Science (CEJCS)</em>. December (2013). |
| Volume: <strong>3</strong>. Number: (4), |
| on pages: 149-157 |
| Chapter: |
| Editor: |
| Publisher: De Gruyter Open: |
| Series: |
| Address: |
| Edition: |
| ISBN: 10.2478/s13537-013-0110-4 |
| how published: 13-40 ToZi13 CEJCS |
| Organization: |
| School: |
| Institution: |
| Type: |
| DOI: |
| URL: |
| ARXIVID: |
| PMID: |
Note: khzimmermann, AEG
Abstract: 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.