Abstract
An optimal parallel algorithm for computing all-pair shortest paths on doubly convex bipartite graphs is presented here. The input is a (0,1)-matrix with consecutive 1s in each of its rows and columns that represents a doubly convex bipartite graph. Our parallel algorithm runs in O(long n) time with O( n 2 log n) processors on an EREW PRAM and is time-and-work-optimal. As a by-product, we show that the problem can be solved by a sequential algorithm in O( n 2) time optimally on any adjacency list or matrix representing a doubly convex bipartite graph. The result in this paper, improves a recent work on the problem for bipartite permutation graphs which are properly contained in doubly convex bipartite graphs.
Sign-in/Register to access full text options 
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.
