Unranking algorithms for combinatorial structures

Abstract

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.Peer ReviewedPostprint (author's final draft

Similar works

Full text

thumbnail-image

UPCommons. Portal del coneixement obert de la UPC

redirect
Last time updated on 01/05/2017

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.