A multi-stack method for the fast generation of permutations with minimal length increasing subsequences

DOI10.1016/S0020-0190(98)00208-7zbMATH Open1338.68208OpenAlexW2040621474MaRDI QIDQ294635FDOQ294635

Dominique Roelants van Baronaigien

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098002087?np=y

zbMATH Keywords

combinatorial problemsconstant amortized timelisting algorithms

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lexicographic permutations with restrictions
• Generating permutations with given ups and downs
• Generating permutations of a bag by interchanges
• A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
• A Unified Setting for Selection Algorithms (II)
• A mechanical counting method and combinatorial applications
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Generation of Permutations by Adjacent Transposition
• Generating alternating permutations lexicographically

Cited In (1)

• The minimum number of monotone subsequences

This page was built for publication: A multi-stack method for the fast generation of permutations with minimal length increasing subsequences

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