1. [1] S. Abraham and K. Padmanabhan, “An analysis of the twisted cube topology,” Proceedings of the International Conference on Parallel Processing, pp.116-120, Pennsylvania State Press, Aug. 1989.
2. [2] Academic Computer Center Cyfronet AGH, “Prometheus and Zeus both on TOP500.” http://www.cyfronet.krakow.pl/en/15366,artykul,p.html
3. [3] A. Bossard, “A set-to-set disjoint paths routing algorithm in hyper-star graphs,” ISCA International Journal of Computers and Their Applications, vol.21, no.1, pp.76-82, March 2014.
4. [4] A. Bossard and K. Kaneko, “The set-to-set disjoint-path problem in perfect hierarchical hypercubes,” The Computer Journal, vol.55, no.6, pp.769-775, June 2012.
5. [5] A. Bossard and K. Kaneko, “Time optimal node-to-set disjoint paths routing in hypercubes,” Journal of Information Science and Engineering, vol.30, no.4, pp.1087-1093, July 2014.