A Unified Setting for Selection Algorithms (II)

DOI10.1016/S0167-5060(08)70327-3zbMath0422.05043MaRDI QIDQ3855214

Herbert S. Wilf

Publication date: 1978

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

zbMATH Keywords

compositionspathsrankingdirected graphsequencingYoung tableauxrandom selectioncombinatorial objectssequencing algorithmaverage number of operationscompactness of the coding scheme

Mathematics Subject Classification ID

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

Related Items

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