Efficient iteration in admissible combinatorial classes

DOI10.1016/j.tcs.2005.08.028zbMath1078.05009OpenAlexW1988640279WikidataQ61734803 ScholiaQ61734803MaRDI QIDQ2581353

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

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

Related Items (1)

The relevant prefixes of coloured Motzkin walks: an average case analysis

Uses Software

• MuPAD
• MuPAD-Combinat
• Gaia

Cites Work

• A method and two algorithms on the theory of partitions
• Random generation of trees and other combinatorial objects
• A calculus for the random generation of labelled combinatorial structures
• Generating words lexicographically: An average-case analysis
• A fast algorithm to generate necklaces with fixed content
• Exhaustive generation of combinatorial objects by ECO
• Computer algebra libraries for combinatorial structures
• A generic approach for the unranking of labeled combinatorial classes
• ECO:a methodology for the enumeration of combinatorial objects
• Mathematical Foundations of Computer Science 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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