Unranking of small combinations from large sets

DOI10.1016/J.JDA.2014.07.004zbMATH Open1308.68147OpenAlexW2049341347MaRDI QIDQ473209FDOQ473209

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

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

zbMATH Keywords

combinationrankingenumerationunranking

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Ranking binary unlabelled necklaces in polynomial time
• Lexicographic ordering, ranking and unranking of combinations
• Successor algorithms via counting arguments
• A generic approach for the unranking of labeled combinatorial classes
• Title not available (Why is that?)

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)