Unranking of small combinations from large sets

DOI10.1016/J.JDA.2014.07.004MaRDI QIDQ473209zbMATH OpenOpenAlexFDO

Authors Toshihiro Shimizu, Takuro Fukunaga, Hiroshi Nagamochi

Publication date 24 November 2014

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2014.07.004

zbMATH Keywords

combinationrankingenumerationunranking

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Exact enumeration problems, generating functions (05A15) Nonnumerical algorithms (68W05)

Recommendations

• A generic approach for the unranking of labeled combinatorial classes
• Ranking and unranking permutations in linear time
• Lexicographical Ordering of k-Subsets of a Set
• Lexicographic ordering, ranking and unranking of combinations
• Lexicographic enumeration, ranking and unranking of permutations ofrout ofnobjects

Cites work

• scientific article; zbMATH DE number 1206598 (Why is no real title available?)
• scientific article; zbMATH DE number 2081005 (Why is no real title available?)
• scientific article; zbMATH DE number 2176112 (Why is no real title available?)
• Algorithm Theory - SWAT 2004
• An algorithm for generating subsets of fixed size with a strong minimal change property
• Chemical trees enumeration algorithms
• ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• Linear-Time Ranking of Permutations
• On computing all abductive explanations from a propositional Horn theory
• Ranking and unranking of B-trees
• Ranking and unranking permutations in linear time
• Support set selection for abductive and default reasoning
• The Enumeration of Maximal Cliques of Large Graphs
• The coolest way to generate combinations
• Unranking and ranking spanning trees of a graph

Cited in

(5)

• Ranking binary unlabelled necklaces in polynomial time
• scientific article; zbMATH DE number 1504592 (Why is no real title available?)
• Lexicographic ordering, ranking and unranking of combinations
• A generic approach for the unranking of labeled combinatorial classes
• Successor algorithms via counting arguments

This page was built for publication: Unranking of small combinations from large sets

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