Author:
Merino Arturo,Namrata ,Williams Aaron
Publisher
Springer Nature Singapore
Reference37 articles.
1. Baril, J.-L.: More restrictive gray codes for some classes of pattern avoiding permutations. Inf. Process. Lett. 109(14), 799–804 (2009)
2. Buck, M., Wiedemann, D.: Gray codes with restricted density. Discret. Math. 48(2–3), 163–171 (1984)
3. Compton, R.C., Williamson, S.G.: Doubly adjacent gray codes for the symmetric group. Linear Multilinear Algebra 35(3–4), 237–293 (1993)
4. Corbett, P.F.: Rotator graphs: an efficient topology for point-to-point multiprocessor networks. IEEE Trans. Parallel Distrib. Syst. 3(05), 622–626 (1992)
5. Demaine, E.D., Eisenstat, S., Rudoy, M.: Solving the rubik’s cube optimally is NP-complete. In: STACS 2018, pp. 24:1–24:13 (2018)