English

Considering Adelman's Shortest Permutation Strings

Combinatorics 2010-10-20 v2

Abstract

In this report, we consider Adelman's algorithm for generating shortest permutation strings. We introduce a new representation approach which reveals some properties of Adelman's algorithm.

Cite

@article{arxiv.1009.5053,
  title  = {Considering Adelman's Shortest Permutation Strings},
  author = {Hesam Dashti},
  journal= {arXiv preprint arXiv:1009.5053},
  year   = {2010}
}
R2 v1 2026-06-21T16:19:04.175Z