Unranking algorithms for combinatorial structures
Rights accessOpen Access
We present an implementation of some unlabeled and labeled unranking algorithms for the open-source algebraic combinatorics package MUPAD-COMBINAT of the computer algebra system MUPAD. We have compared our implementation with the previous versions. All our algorithms improve the previous ones with respect to the required CPU time. Moreover, we have also developed unranking algorithms applied to some unlabeled and labeled admissible operators that are not still implemented in the package MUPAD-COMBINAT. These algorithms are also able to develop some combinatorial structures useful to generate molecules applied to chemistry and influence graphs applied to game theory and social networks, among other topics.
CitationMolinero, X., Vives, J. Unranking algorithms for combinatorial structures. "International Journal of Applied Mathematics and Informatics", Desembre 2015, vol. 9, p. 110-115.