𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars

✍ Scribed by F. Drewes

Publisher
Springer
Year
1999
Tongue
English
Weight
830 KB
Volume
32
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The obstructions of a minor-closed set o
The obstructions of a minor-closed set of graphs defined by a context-free grammar
✍ B Courcelle; G SΓ©nizergues πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 979 KB

We establish that the finite set of obstructions of a minor-closed set of graphs given by a hyperedge replacement grammar can be effectively constructed. Our proof uses an auxiliary result stating that the system of equations associated with a proper hyperedge replacement grammar has a unique soluti

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