Abstract
In this paper, we develop a new parallel algorithm for the minimum coloring problem on interval graphs. Our method is both easy to understand and easy to implement. Given a set of n intervals, our parallel algorithm takes O(log n) time and O( n) processors on the EREW PRAM model. Also, if the intervals are sorted, it takes O(log n) time and O( n/log n) processors on the EREW PRAM model. Both the sorted and unsorted cases are cost optimal.
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.
