Exhaustive generation of combinatorial objects by ECO

Authors:
Silvia Bacchelli;Elena Barcucci;Elisabetta Grazzini;Elisa Pergola
Affiliations:
University of Bologna, Via Sacchi, 3, 47023, Cesena, Italy;University of Firenze, Dipartimento di Sistemi e Informatica, Via Lombroso, 6/17, 50134, Firenze, Italy;University of Firenze, Dipartimento di Sistemi e Informatica, Via Lombroso, 6/17, 50134, Firenze, Italy;University of Firenze, Dipartimento di Sistemi e Informatica, Via Lombroso, 6/17, 50134, Firenze, Italy
Venue:
Acta Informatica
Year:
2004

Citing 0
Cited 5

Enumeration of L-convex polyominoes by rows and columns

Theoretical Computer Science
Efficient iteration in admissible combinatorial classes

Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Combinatorial Gray codes for classes of pattern avoiding permutations

Theoretical Computer Science
Generating restricted classes of involutions, Bell and Stirling permutations

European Journal of Combinatorics
Binary bubble languages and cool-lex order

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of exhaustively generating combinatorial objects can currently be applied to many disciplines, such as biology, chemistry, medicine and computer science. A well known approach to the exhaustive generation problem is given by the Gray code scheme for listing n-bit binary numbers in such a way that successive numbers differ in exactly one bit position. In this work, we introduce an exhaustive generation algorithm, which is general for the classes of succession rules considered in [1]. We also show that our algorithm is efficient in an amortized sense; it actually uses only a constant amount of computation per object.