I. Dutour

Learn More
This article presents a new systematic approach for the uniform random generation of combinatorial objects. The method is based on the notion of object grammars which are recursive descriptions of objects generalizing context-free grammars. The application of particular valuations to these grammars allows to reach to enumeration and random generation of(More)
A new systematic approach for the speciication of bijections between sets of combinatorial objects is presented. It is based on the notion of object grammars. Object grammmars are recursive descriptions of objects which generalize context free grammars. The study of a particular substitution in these object grammars connrms once more the key role of Dyck(More)
The Graph Drawing community uses test suites for comparing layout quality and eeciency. Those suites often claim to collect randomly generated graphs, although in most cases randomness is a loosely deened notion. We propose a simple algorithm for generating acyclic digraphs with a given number of vertices uniformly at random. Applying standard combinatorial(More)
  • 1