Abstract of Paper

Generic Algorithms for the Generation of Combinatorial Objects
by Conrado Martinez and Xavier Molinero


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