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 2) time algorithm for the all-pairs shortest-paths problem on arbitrary bipartite permutation graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
