Minimal vs. non Minimal Adaptive Routing on k-ary n-cubes

Fabrizio Petrini, Marco Vanneschi. Minimal vs. non Minimal Adaptive Routing on k-ary n-cubes. In Hamid R. Arabnia, editor, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 1996, August 9-11, 1996, Sunnyvale, California, USA. pages 505-515, CSREA Press, 1996.

Abstract

Abstract is missing.