ON THE COMPUTATIONAL COMPLEXITY OF ROUTING IN FAULTY K-ARY N-CUBES AND HYPERCUBES (2012)
Attributed to:
Tolerating faults in interconnection networks for parallel computing
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1142/s012962641250003x
Publication URI: http://dx.doi.org/10.1142/s012962641250003x
Type: Journal Article/Review
Parent Publication: Parallel Processing Letters
Issue: 01