On the Computational Complexity of Routing in Faulty k-ary n-Cubes and Hypercubes

Iain A. Stewart. On the Computational Complexity of Routing in Faulty k-ary n-Cubes and Hypercubes. Parallel Processing Letters, 22(1), 2012. [doi]

Abstract

Abstract is missing.