Generating alternating permutations lexicographically

DOI10.1007/BF01932127zbMath0692.68026MaRDI QIDQ583885

Frank Ruskey, Bruce L. Bauslaugh

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

permutationsalgorithms

Mathematics Subject Classification ID

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

Related Items

A multi-stack method for the fast generation of permutations with minimal length increasing subsequences ⋮ Whole mirror duplication-random loss model and pattern avoiding permutations ⋮ Generating permutations with given ups and downs ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ More restrictive Gray codes for some classes of pattern avoiding permutations ⋮ A CAT algorithm for generating permutations with a fixed number of inversions

Cites Work

• Transposition generation of alternating permutations
• Lexicographic generation of ordered trees
• A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
• Generating binary trees by transpositions
• Generating the Linear Extensions of Certain Posets by Transpositions
• Generating Trees and Other Combinatorial Objects Lexicographically
• On the generation of all topological sortings
• Computation of Tangent, Euler, and Bernoulli Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item