A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Suppose ach node (and each edge) of a network is independently faulty with probability at most p (and q, respectively), where 0<p, q<1 are arbitrary constants independent of the size of the network. For each fixed integer d≥2, we construct a network with O(N) nodes and with degree O( log log N) such that, after removing all the faulty nodes and edges, it still contains the N-node d-dimensional N1/d× ... ×N1/d torus, and hence the mesh of the same size, with probability 1 - N-Ω(lof log N). This is derived as a consequence of a simple constant-degree construction which tolerates random faults, where the failure probability of each node is O(log-3dN). We also give a simple constant-degree construction with O(N) nodes that tolerates O(N(1-2-d)/d) worst case faults. © 1996 Academic Press, Inc.
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
J. LaRue, C. Ting
Proceedings of SPIE 1989
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Peter Wendt
Electronic Imaging: Advanced Devices and Systems 1990