求最短子排列序及长度的一个图论方法

SHORTEST STRING SUCCESSIVE CONTAINING ALL k-PERMUTATIONS BY GRAPH THEORY

本文推广了DeBruijn图,用图论方法讨论了最短子排列序列,其结果可应用于编码、通迅、计算机存储等领域。

In this paper, We extended the DeBruijn graph and discussed the shortest string successive containing all k-permutations by graph theory. The result may be used in the domain of coding, communication computer etc.