Abstract

A study is made of several classes of intersection graphs, i.e. interval graphs, circular-arc graphs, and some of their subclasses. It is shown that recognizing a proper interval graph, a unit interval graph, and a claw-free interval graph is in NC. In fact, the recognition can be done in O(log/sup 2/ n) time with O(n/sup 3/) processors. The corresponding interval representation can be obtained within the same time bound if O(n/sup 4/) processors are used. Some necessary and sufficient conditions for the minimum interval representations are obtained. An NC algorithm is presented which constructs a circular-arc representation for the graph whose augmented adjacency matrix has quasi-circular 1's or has the consecutive 0's property. >

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.