A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects

DOI10.1016/S0001-8708(77)80046-7zbMath0354.05041MaRDI QIDQ1236548

Herbert S. Wilf

Publication date: 1977

Published in: Advances in Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Directed graphs (digraphs), tournaments (05C20) Theory of error-correcting codes and error-detecting codes (94B99) Algorithms in computer science (68W99)

Related Items

Watermelon uniform random generation with applications, A multi-stack method for the fast generation of permutations with minimal length increasing subsequences, Inside the binary reflected gray code: flip-swap languages in 2-gray code order, Uniform random generation of words of rational languages, Combinatorial identities by way of Wilf's multigraph model, Inductive and injective proofs of log concavity results, Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences, Random and uniform generation of words, A loop-free algorithm for generating the linear extensions of a poset, A new dichotomic algorithm for the uniform random generation of words in regular languages, Non-redundant random generation algorithms for weighted context-free grammars, Flip-swap languages in binary reflected Gray code order, Taming reluctant random walks in the positive quadrant, A lattice walk approach to the inv and maj q-counting of multiset permutations, Generating permutations with given ups and downs, On the log-convexity of combinatorial sequences, Inductive proofs of \(q\)-log concavity, Counting, Generating, Analyzing and Sampling Tree Alignments, Generating alternating permutations lexicographically, Random k -noncrossing RNA structures, Enumeration des tableaux Standards, Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models, Counting, Generating and Sampling Tree Alignments, Random generation of trees and other combinatorial objects, Generating binary trees of bounded height

Cites Work

• A method and two algorithms on the theory of partitions
• On the sequential and random selection of subspaces over a finite field