Generating alternating permutations lexicographically

DOI10.1007/BF01932127MaRDI QIDQ583885zbMATH OpenFDO

Authors Frank Ruskey, Bruce L. Bauslaugh

Publication date 1990

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

permutationsalgorithms

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• Generating permutations with given ups and downs
• Generation of Permutations Following Lehmer and Howell
• Transposition generation of alternating permutations
• scientific article; zbMATH DE number 3557795
• A new algorithm for generation of permutations

Cites work

• scientific article; zbMATH DE number 4041254 (Why is no real title available?)
• scientific article; zbMATH DE number 4106841 (Why is no real title available?)
• scientific article; zbMATH DE number 3748431 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3557795 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 3233639 (Why is no real title available?)
• A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
• Computation of Tangent, Euler, and Bernoulli Numbers
• Generating Trees and Other Combinatorial Objects Lexicographically
• Generating binary trees by transpositions
• Generating the Linear Extensions of Certain Posets by Transpositions
• Lexicographic generation of ordered trees
• On the generation of all topological sortings
• Transposition generation of alternating permutations

Cited in

(12)

• scientific article; zbMATH DE number 434868 (Why is no real title available?)
• A multi-stack method for the fast generation of permutations with minimal length increasing subsequences
• Lexicographic ranking and unranking of derangements in cycle notation
• Generation of Permutations Following Lehmer and Howell
• A new algorithm for generation of permutations
• Loopless generation of up-down permutations
• A CAT algorithm for generating permutations with a fixed number of inversions
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• Generating permutations with given ups and downs
• Whole mirror duplication-random loss model and pattern avoiding permutations
• On zigzag permutations and comparisons of adjacent elements
• More restrictive Gray codes for some classes of pattern avoiding permutations

This page was built for publication: Generating alternating permutations lexicographically

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