Fault-Tolerant Meshes with Small Degree

DOI10.1137/S0097539794274994zbMath0885.68019OpenAlexW2043432192MaRDI QIDQ4376198

Jehoshua Bruck, Robert Cypher, Ching-Tien Ho

Publication date: 10 February 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539794274994

zbMATH Keywords

graph theoryparallel computinginterconnection networksmeshfault-tolerancearray

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (8)

Networks with small stretch number ⋮ Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs ⋮ Minimum \(k\)-critical bipartite graphs ⋮ Spatio-spectral limiting on discrete tori: adjacency invariant spaces ⋮ (\(k,+\))-distance-hereditary graphs ⋮ Self-spanner graphs ⋮ A note on edge fault tolerance with respect to hypercubes ⋮ Applying fault-tolerant solutions of circulant graphs to multidimensional meshes

This page was built for publication: Fault-Tolerant Meshes with Small Degree