Show simple item record

dc.contributor.authorMolinero Albareda, Xavier
dc.contributor.authorMartínez Parra, Conrado
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.identifier.citationMolinero, X., Martinez, C. "Generic algorithms for the generation of combinatorial objects". 2003.
dc.description.abstractThis report 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 A using combinatorial 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 thus they are suitable for rapid prototyping or for inclusion in general libraries.
dc.format.extent10 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherUnlabelled combinatorial classes
dc.subject.otherLabelled combinatorial classes
dc.subject.otherGeneric algorithms
dc.subject.otherCombinatorial objects generation
dc.titleGeneric algorithms for the generation of combinatorial objects
dc.typeExternal research report
dc.contributor.groupUniversitat Politècnica de Catalunya. GRTJ - Grup de Recerca en Teoria de Jocs
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
local.citation.authorMolinero, X.; Martinez, C.

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder