Generating and characterizing the perfect elimination orderings of a chordal graph (2003)
by
L. S. Chandran
,
L. Ibarra
,
F. Ruskey
,
J. Sawada
| Citations: | 4 - 1 self |
BibTeX
@MISC{Chandran03generatingand,
author = {L. S. Chandran and L. Ibarra and F. Ruskey and J. Sawada},
title = {Generating and characterizing the perfect elimination orderings of a chordal graph},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
WedevelV a constant time transposition"oraclo for the set of perfectelectd-V-U orderings of chordal graphs. Using thisoracl; we can generate a Gray code ofal perfectelectd-;;- orderings in constant amortized time using knownresul: about antimatroids. Using clngd trees, we show how theinitialdW:A-: of theald:::Eq can be performedinlerfo time. Weal- develB two new characterizations of perfectelectd::qq orderings: one in terms ofchordlqd paths, and the other in terms u-v separators.
