#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1995

2003

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

The Graph Drawing community uses test suites for comparing layout quality and eciency. Those suites often claim to collect randomly generated graphs, although in most cases randomness is a loosely dened notion. We p ropose a simple algorithm for generating acyclic digraphs with a given number of vertices uniformly at random. Applying standard combinatorial… (More)

- Guy Melançon, I. Dutour, Mireille Bousquet-Mélou
- Electronic Notes in Discrete Mathematics
- 2001

- I. Dutour, Jean-Marc Fedou
- Discrete Mathematics & Theoretical Computer…
- 1998

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)

- Jean-Philippe Dubernard, I. Dutour
- Discrete Mathematics
- 1996

- Maylis Delest, Jean-Philippe Dubernard, I. Dutour
- J. Symb. Comput.
- 1995

(Received) We give an equation satissed by the generating function for parallelogram polyominoes according to the area, the width and the number of left path corners. Next, we give an explicit formula for the generating function of these polyominoes according to the area, the width and the number of right and left paths corners.

- I. Dutour, Jean-Marc Fedou
- Theor. Comput. Sci.
- 2003

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)

- G Melancon, I Dutour, +4 authors M Elou
- 2000

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
- ›