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

Abstract

We equate a routing algorithm in a (faulty) interconnection network whose underlying graph is a k-ary n-cube or a hypercube, that attempts to route a packet from a fixed source node to a fixed destination node, with the sub-digraph of (healthy) links potentially usable by this routing algorithm as it attempts to route the packet. This gives rise to a… (More)
DOI: 10.1142/S012962641250003X

Topics

Cite this paper

@article{Stewart2012OnTC, title={On the Computational Complexity of Routing in Faulty k-ary n-Cubes and Hypercubes}, author={Iain A. Stewart}, journal={Parallel Processing Letters}, year={2012}, volume={22} }