Solving the shortest-paths problem on bipartite permutation graphs efficiently

doi:10.1016/0020-0190(95)00084-P

Information Processing Letters

Volume 55, Issue 5, 15 September 1995, Pages 259-264

https://doi.org/10.1016/0020-0190(95)00084-P Get rights and content

Abstract

In this paper we present optimal sequential and parallel algorithms for the shortest-paths problems on strongly ordered bipartite (permutation) graphs. The parallel algorithm runs in O(logn) time on a CREW PRAM and is both time-optimal and work-optimal. With a published procedure as a subroutine, this work immediately leads to an optimal O(n²) time algorithm for the all-pairs shortest-paths problem on arbitrary bipartite permutation graphs.

References (15)

L. Chen
Optimal parallel time bounds for the maximum clique problem on intervals
Inform. Process. Lett.
(1992)
J. Spinrad et al.
Bipartite permutation graphs
Discrete Appl. Math.
(1987)
T. Takaoka
A new upper bound on the complexity of the all pairs shortest path problem
Inform. Process. Lett.
(1992)
S.G. Akl
The Design and Analysis of Parallel Algorithms
(1989)
S.G. Akl et al.
Broadcasting with selective reduction
L. Chen et al.
Efficient parallel algorithms for bipartite permutation graphs
Networks
(1993)
R. Cole et al.
Approximate parallel scheduling, part I: The basic technique with applications to optimal parallel list ranking in logarithmic time
SIAM J. Comput.
(1988)

There are more references available in the full text version of this article.

Cited by (0)

View full text

Solving the shortest-paths problem on bipartite permutation graphs efficiently

Abstract

Inform. Process. Lett.

Discrete Appl. Math.

Inform. Process. Lett.

The Design and Analysis of Parallel Algorithms

Broadcasting with selective reduction

Efficient parallel algorithms for bipartite permutation graphs

Networks

Approximate parallel scheduling, part I: The basic technique with applications to optimal parallel list ranking in logarithmic time

SIAM J. Comput.