Lexicographic permutations with restrictions

DOI10.1016/0166-218X(79)90018-0MaRDI QIDQ1133901zbMATH OpenFDO

Authors Donald E. Knuth

Publication date 1979

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(79)90018-0

zbMATH Keywords

lexicographic permutationsrestricted permutations

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Cites work

• A method and two algorithms on the theory of partitions
• A structured program to generate all topological sorting arrangements
• Efficiency of a Good But Not Linear Set Union Algorithm
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)

Cited in

(2)

• Generating linear extensions of posets by transpositions
• A multi-stack method for the fast generation of permutations with minimal length increasing subsequences

This page was built for publication: Lexicographic permutations with restrictions

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