• Journal of applied mathematics & informatics
• /
• 제5권2호
• /
• pp.329-336
• /
• 1998

The class of doubly chordal graphs is a subclass of chordal graphs and a superclass of strongly chordal graphs which arise in so many application areas. Many optimization problems like domination and Steiner tree are NP-complete on chordal graps 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) double perfect elimination ordering of a doubly chordal graph.

• Journal of applied mathematics & informatics
• /
• 제5권1호
• /
• pp.65-72
• /
• 1998

Many optimization problems like domination and Steiner tree are NP-complete on chordal graphs but can be solved in polyno-mial time on doubly chordal graphs. Investigating properties of dou-bly chordal graphs probably help to design efficient algorithms for the graphs. We present some characterizations of dobly chordal graphs which are based on clique matrices and neighborhood matrics also men-tioned how a doubly perfect elimination ordering of a doubly chordal graph can be computed from the results.