Enumeration and Generation of Permutations with a Partially Fixed Order of Elements
Abstract. 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. S...
Salvato in:
| Pubblicato in: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Autori principali: | , , , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
International Journal of Combinatorial Optimization Problems and Informatics
2017
|
| Soggetti: | |
| Accesso online: | https://www.redalyc.org/articulo.oa?id=265253895004 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|