Parallel and Distributed Computing Combinatorial Algorithms

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 single fault by adding an extra stage of hardware to the networks.