Abstract
We define a class of graphs which generalizes the well-known class of cographs or complement-reducible graphs and show that the graphs in our class can be recognized fast in parallel. More precisely, with an arbitrary graph G with n vertices and m edges as input, the proposed recognition algorithm runs in O(log n) time using O(( n 2/log n)+ mn) processors on an EREW 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.
