ALCOMFT-TR-03-4

Conrado Mart\'\inez and Xavier Molinero
Generic Algorithms for the Generation of Combinatorial Objects
Barcelona. Work package 4. June 2003.

Abstract: This paper briefly describes our generic approach to the exhaustive generation of unlabelled and labelled combinatorial classes. Our algorithms receive a size n and a finite description of a combinatorial class \mathcalA using combinatorial operators such as union, product, set or sequence, in order to list all objects of size n in \mathcalA. The algorithms work in constant amortized time per generated object and thus they are suitable for rapid prototyping or for inclusion in general libraries.

Postscript file: ALCOMFT-TR-03-4.ps.gz (93 kb).