Parallel and Distributed Computing Combinatorial Algorithms
Published • Oct 1, 1993
NobleIDNI9P545W513R446S968
Authors:
Tom Leighton
Abstract
Abstract : The first methods for tolerating more than a small number of worst- case faults in commonly-Lised networks such as the butterfly, the mesh of trees, and other hypercubic networks. Previously, work on the fault-tolerance properties of these networks was limited to showing how to overcome a...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!