Abstract
The author presents a parallel algorithm of cost O(n log n) to find a maximum independent set of a circular arc graph. In the CREW PRAM model the algorithm takes O(log n) time, while in the EREW PRAM model it requires O(log/sup 2/ n) time. It illustrates the use of divide-and-conquer in parallel algorithms. The heart of the algorithm solves this problem on an interval graph, which is derived from the given circular arc graph. Postprocessing selects a maximum independent set on the given circular arc graph. >
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.
