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 \(\mathcal{A}\) using combinatorial operators such as union, product, set or sequence, in order to list all objects of size n in \(\mathcal{A}\). The algorithms work in constant amortized time per generated object and thus they are suitable for rapid prototyping or for inclusion in general libraries.
This research was supported by the Future and Emergent Technologies programme of the EU under contract IST-1999-14186 (ALCOM-FT) and the Spanish “Ministerio de Ciencia y Tecnología” programme TIC2002-00190 (AEDRI II).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Flajolet, P., Salvy, B.: Computer algebra libraries for combinatorial structures. J. Symbolic Computation 20, 653–671 (1995)
Flajolet, P., Zimmerman, P., van Cutsem, B.: A calculus for the random generation of combinatorial structures. Theoret. Comput. Sci. 132(1-2), 1–35 (1994)
Greene, D.H.: Labelled Formal Languages and Their Uses. PhD thesis, Computer Science Dept., Stanford University (1983)
Kemp, R.: Generating words lexicographically: An average-case analysis. Acta Informatica 35(1), 17–89 (1998)
Martínez, C., Molinero, X.: Generic algorithms for the exhaustive generation of labelled objects. In: Proc. Workshop on Random Generation of Combinatorial Structures and Bijective Combinatorics (GASCOM), pp. 53–58 (2001)
Martínez, C., Molinero, X.: A generic approach for the unranking of labelled combinatorial classes. Random Structures & Algorithms 19(3-4), 472–497 (2001)
Nijenhuis, A., Wilf, H.S.: Combinatorial Algorithms. Academic Press, London (1978)
Reingold, E.M., Nievergelt, J., Deo, N.: Combinatorial Algorithms: Theory and Practice. Prentice-Hall, Englewood Cliffs (1977)
Sedgewick, R., Flajolet, P.: An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading (1996)
Vitter, J.S., Flajolet, P.: Average-case analysis of algorithms and data structures. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 9. North-Holland, Amsterdam (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martínez, C., Molinero, X. (2003). Generic Algorithms for the Generation of Combinatorial Objects. In: Rovan, B., Vojtáš, P. (eds) Mathematical Foundations of Computer Science 2003. MFCS 2003. Lecture Notes in Computer Science, vol 2747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45138-9_51
Download citation
DOI: https://doi.org/10.1007/978-3-540-45138-9_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40671-6
Online ISBN: 978-3-540-45138-9
eBook Packages: Springer Book Archive