Abstract

This work presents simple and efficient algorithms for a trapezoid graph. They are (1) an algorithm for counting the number of vertex covers, (2) an algorithm for counting the number of minimal vertex covers, and (3) an algorithm for counting the number of minimum vertex covers and maximum minimal vertex covers simultaneously. All the proposed algorithms have a time complexity of O ( n 2 ) , where n is the number of vertices in the trapezoid graph.

Full Text
Paper version not known

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.