A Unified Setting for Selection Algorithms (II)

DOI10.1016/S0167-5060(08)70327-3MaRDI QIDQ3855214zbMATH OpenFDO

Authors Herbert S. Wilf

Publication date 1978

Published in Algorithmic Aspects of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-5060(08)70327-3

zbMATH Keywords

average number of operationscombinatorial objectscompactness of the coding schemecompositionsdirected graphpathsrandom selectionrankingsequencingsequencing algorithmYoung tableaux

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Permutations, words, matrices (05A05) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Cited in

(5)

• Inductive and injective proofs of log concavity results
• Generating permutations with given ups and downs
• Inductive proofs of \(q\)-log concavity
• Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
• A multi-stack method for the fast generation of permutations with minimal length increasing subsequences

This page was built for publication: A Unified Setting for Selection Algorithms (II)

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