Abstract
The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. In this paper we present two new characterizations of the cographs and show how to use them for the purpose of producing a parallel recognition algorithm for this class of graphs. In addition, if the graph under investigation turns out to be a cograph, our algorithm constructs its corresponding cotree. With an arbitrary graph G with n vertices and m edges as input, the proposed algorithm runs in O(log n) time using O(( n 2 + mn)/log n) processors on an EREW parallel random access machine.
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.
