𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computation of a (canonical) doubly perfect elimination ordering of a doubly chordal graph

✍ Scribed by Lee, Mahnhoon ;Kim, Changhwa

Publisher
Springer-Verlag
Year
1998
Tongue
English
Weight
119 KB
Volume
5
Category
Article
ISSN
1226-0061

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Perfect elimination orderings of chordal
Perfect elimination orderings of chordal powers of graphs
✍ Andreas BrandstΓ€dt; Victor D. Chepoi; Feodor F. Dragan πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 378 KB

Let G = (V,E) be a finite undirected connected graph. We show that there is a common perfect elimination ordering of all powers of G which represent chordal graphs. Consequently, if G and all of its powers are chordal then all these graphs admit a common perfect elimination ordering. Such an orderin

Generating and characterizing the perfec
Generating and characterizing the perfect elimination orderings of a chordal graph
✍ L.S. Chandran; L. Ibarra; F. Ruskey; J. Sawada πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 402 KB

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