Chandran, LS and Ibarra, L and Ruskey, F and Sawada, J (2003) Generating and characterizing the perfect elimination orderings of a chordal graph. In: Theoretical Computer Science, 307 (2). pp. 303-317.
Restricted to Registered users only
Download (401Kb) | Request a copy
We develop a constant time transposition "oracle" for the set of perfect elimination orderings of chordal graphs. Using this oracle, we can generate a Gray code of all perfect elimination orderings in constant amortized time using known results about antimatroids. Using clique trees, we show how the initialization of the algorithm can be performed in linear time. We also develop two new characterizations of perfect elimination orderings: one in terms of chordless path; and the other in terms of minimal u-v separators.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Elsevier.|
|Keywords:||Perfect elimination ordering;Chordal graph;Gray code;Antimatroid;2-Processor scheduling;Clique tree|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||30 Jun 2008|
|Last Modified:||19 Sep 2010 04:37|
Actions (login required)