Abstract

A problem to make a graph strongly connected is one of the most fundamental problems in graph theory. The known parallel algorithm solves this problem in O(log n) time using O(n3) processors on a CRCW PRAM model. In this paper we present a parallel algorithm to find the minimum edges to make a disconnected directed acyclic graph strongly connected in O(log(m + n)) time using O(m + n) processors on a CREW PRAM model. This algorithm is an efficient parallel algorithm because the number of processors varies according to the density of the given graph.

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

Disclaimer: 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.