Unranking of small combinations from large sets

DOI10.1016/j.jda.2014.07.004zbMath1308.68147MaRDI QIDQ473209

Hiroshi Nagamochi, Toshihiro Shimizu, Takuro Fukunaga

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

ranking; enumeration; combination; unranking

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

68W05: Nonnumerical algorithms

68R05: Combinatorics in computer science

Related Items

Ranking binary unlabelled necklaces in polynomial time

Cites Work

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