1. Draper, J.T., Ghosh, J.: Multipath e-cube algorithms (MECA) for adaptive wormhole routing and broadcasting in k-ary n-cubes. In: International Parallel Processing Symposium, pp. 407–410 (1992)
2. Szymanski, T.: On the permutation capability of a circuit switched hypercube. In: International Conference on Parallel Processing, pp. I-103–I-110. IEEE Computer Society Press, Silver Spring (1989)
3. Lubiw, A.: Counter example to a conjecture of Szymanski on hypercube routing. Informations Processing Letters 35, 57–61 (1990)
4. Zhang, L.: Optimal bounds for matching routing on trees. In: 8th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, pp. 445–453 (1997)
5. Hwang, F., Yao, Y., Grammatikakis, M.: A d-move local permutation routing for d-cube. Discrete Applied Mathematics 72, 199–207 (1997)