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

05C35: Extremal problems in graph theory

05A17: Combinatorial aspects of partitions of integers

05A05: Permutations, words, matrices

05C20: Directed graphs (digraphs), tournaments

94B99: Theory of error-correcting codes and error-detecting codes

68W99: Algorithms in computer science

Related Items

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

Cites Work

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