Generating alternating permutations lexicographically

DOI10.1007/BF01932127zbMATH Open0692.68026MaRDI QIDQ583885FDOQ583885

Authors: Frank Ruskey, Bruce L. Bauslaugh 

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

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

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)

Cites Work

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

Cited In (12)

• Title not available (Why is that?)
• A multi-stack method for the fast generation of permutations with minimal length increasing subsequences
• Generation of Permutations Following Lehmer and Howell
• Lexicographic ranking and unranking of derangements in cycle notation
• Loopless generation of up-down permutations
• A new algorithm for generation of 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)