Lexicographical Ordering of k-Subsets of a Set

DOI10.1080/02522667.1986.10698845MaRDI QIDQ3742726zbMATH OpenOpenAlexFDO

Authors M. C. Er

Publication date 1986

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1986.10698845

zbMATH Keywords

lexicographical orderrecursive algorithm

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Searching and sorting (68P10)

Recommendations

• Approximate Quadrature Measures on Data-Defined Spaces
• scientific article; zbMATH DE number 559036
• scientific article; zbMATH DE number 3917730
• An algorithm for generating subsets of fixed size with a strong minimal change property
• scientific article; zbMATH DE number 822743

Cited in

(7)

• Some examples of lexicographic order algorithms and some open combinatorial problems
• scientific article; zbMATH DE number 3917730 (Why is no real title available?)
• scientific article; zbMATH DE number 559036 (Why is no real title available?)
• Approximate Quadrature Measures on Data-Defined Spaces
• Unranking of small combinations from large sets
• scientific article; zbMATH DE number 822743 (Why is no real title available?)
• Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees

This page was built for publication: Lexicographical Ordering of k-Subsets of a Set

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