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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
