Lexicographic permutations with restrictions

DOI10.1016/0166-218X(79)90018-0zbMath0422.68030MaRDI QIDQ1133901

Donald E. Knuth

Publication date: 1979

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

zbMATH Keywords

restricted permutationslexicographic permutations

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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