Show simple item record

dc.creatorYuri G. Stoyan
dc.creatorIgor V. Grebennik
dc.creatorViacheslav V. Kalashnikov
dc.creatorOleksandr S. Lytvynenko
dc.date2017
dc.date.accessioned2019-10-08T20:38:32Z
dc.date.available2019-10-08T20:38:32Z
dc.identifierhttp://www.redalyc.org/articulo.oa?id=265253895004
dc.identifier.urihttp://hdl.handle.net/11285/635770
dc.descriptionAbstract. A specific class of permutations permutations with partially fixed order of elements has been described. A procedure of enumeration and generation of this class has been developed. Steps of the algorithm have been established to be well-defined, and its complexity has been evaluated. Some important particular classes of permutations, such as alternating and unimodal ones are special cases of the permutations described. This algorithm can be used for generating other combinatorial sets, e.g. arrangements and combinations.
dc.formatapplication/pdf
dc.languageen
dc.publisherInternational Journal of Combinatorial Optimization Problems and Informatics
dc.relationhttp://www.redalyc.org/revista.oa?id=2652
dc.rightsInternational Journal of Combinatorial Optimization Problems and Informatics
dc.sourceInternational Journal of Combinatorial Optimization Problems and Informatics (México) Num.1 Vol.8
dc.subjectComputación
dc.subjectEnumeration and Generation of Permutations
dc.subjectPartially Fixed Order of Elements
dc.titleEnumeration and Generation of Permutations with a Partially Fixed Order of Elements
dc.typeArtículo científico


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Redalyc 1436
    Red de Revistas Científicas de América Latina y el Caribe, España y Portugal

Show simple item record