Abstract
In this paper we study the problem of finding a maximum weight clique of an interval graph. Let n be the number of vertices in the graph. We show that a maximum weight clique of an interval graph can be found in time O(log n) using n processors on an exclusive-read exclusive-write parallel random access machine.
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.
