Efficient iteration in admissible combinatorial classes

DOI10.1016/J.TCS.2005.08.028MaRDI QIDQ2581353zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Xavier Molinero, Conrado Martínez

Publication date 10 January 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2005.08.028

zbMATH Keywords

UnrankingConstant amortized timeGeneration of combinatorial objectsGeneration of combinatorial objects in lexicographic orderIteration in combinatorial classes

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Combinatorics in computer science (68R05)

Recommendations

• Mathematical Foundations of Computer Science 2003
• scientific article; zbMATH DE number 3864523
• A generic approach for the unranking of labeled combinatorial classes
• scientific article; zbMATH DE number 2127730
• Exhaustive generation of combinatorial objects by ECO

Cites work

• scientific article; zbMATH DE number 2127730 (Why is no real title available?)
• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 2040945 (Why is no real title available?)
• scientific article; zbMATH DE number 815575 (Why is no real title available?)
• A calculus for the random generation of labelled combinatorial structures
• A fast algorithm to generate necklaces with fixed content
• A generic approach for the unranking of labeled combinatorial classes
• A method and two algorithms on the theory of partitions
• Computer algebra libraries for combinatorial structures
• ECO:a methodology for the enumeration of combinatorial objects
• Exhaustive generation of combinatorial objects by ECO
• Generating words lexicographically: An average-case analysis
• Mathematical Foundations of Computer Science 2003
• Random generation of trees and other combinatorial objects

Cited in

(6)

• Mathematical Foundations of Computer Science 2003
• Generation of combinatorial elements using OOP
• Exhaustive generation of combinatorial objects by ECO
• The relevant prefixes of coloured Motzkin walks: an average case analysis
• Combinatorial generation algorithms based on and/or tree structures for a class of algebraic generating functions
• scientific article; zbMATH DE number 1504644 (Why is no real title available?)

Describes a project that uses

Uses Software

• Gaia
• MuPAD-Combinat
• MuPAD

This page was built for publication: Efficient iteration in admissible combinatorial classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581353)