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.
Full Text
Published Version
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