Abstract
The class ofdoubly chordal graphs is a subclass ofchordal graphs and a superclass ofstrongly chordal graphs, which arise in so many application areas. Many optimization problems like domination and Steiner tree are NP-complete on chordal graphs but can be solved in polynomial time on doubly chordal graphs. The central to designing efficient algorithms for doulby chordal graphs is the concept of(canonical) doubly perfect elimination orderings. We present linear time algorithms to compute a(canonical) doubly perfect elimination ordering of adoubly chordal graph.
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 callMore From: Korean Journal of Computational & Applied Mathematics
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.
