On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs
Author:
Roy SumanORCID,
Krishnaswamy Srinivasan,
Vinod Kumar P.
Publisher
Springer Singapore
Reference12 articles.
1. Annexstein, F.S.: Generating de Bruijn sequences: an efficient implementation. IEEE Trans. Comput. 46(2), 198–200 (1997)
2. Bidkhori, H., Kishore, S.: A bijective proof of a theorem of Knuth. Comb. Probab. Comput. 20(1), 11–25 (2011)
3. De Bruijn, N.G.: A Combinatorial Problem. Koninklijke Nederlandsche Akademie Van Wetenschappen, vol. 49, no. 6, pp. 758–764, June 1946
4. Etzion, T., Lempel, A.: Algorithms for the generation of full-length shift-register sequences. IEEE Trans. Inf. Theory 30(3), 480–484 (1984)
5. Fredricksen, H.: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev. 24(2), 195–221 (1982)