An efficient generic algorithm for the generation of unlabelled cycles

MaRDI QIDQ3154677zbMATH OpenFDO

Authors Conrado Martínez, Xavier Molinero

Publication date 14 January 2005

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Mathematical Foundations of Computer Science 2003
• A generic approach for the unranking of labeled combinatorial classes
• scientific article; zbMATH DE number 1445312
• Random and exhaustive generation of permutations and cycles
• A calculus for the random generation of labelled combinatorial structures

Cited in

(4)

• Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
• Efficient iteration in admissible combinatorial classes
• Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
• Mathematical Foundations of Computer Science 2003

This page was built for publication: An efficient generic algorithm for the generation of unlabelled cycles

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