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...
Na minha lista:
| 发表在: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Principais autores: | , , , |
| 格式: | Artigo |
| 语言: | Inglês |
| 出版: |
International Journal of Combinatorial Optimization Problems and Informatics
2017
|
| 主题: | |
| 在线阅读: | https://www.redalyc.org/articulo.oa?id=265253895004 |
| 标签: |
没有标签, 成为第一个标记此记录!
|