Subcube fault-tolerance in hypercubes

DOI10.1006/inco.1993.1010zbMath0785.68006OpenAlexW2171057724MaRDI QIDQ1207961

Quentin F. Stout, Niall Graham, Frank Harary, Marilynn L. Livingston

Publication date: 16 May 1993

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/30996

zbMATH Keywords

testingfault-toleranceparallel computerhypercube computer

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (14)

On the extremal combinatorics of the Hamming space ⋮ A special case of set covering problems ⋮ Subgraphs of a hypercube containing no small even cycles ⋮ Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets ⋮ On a covering problem in the hypercube ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ Recursive fault-tolerance of Fibonacci cube in hypercubes ⋮ Subspace restrictions and affine composition for covering perfect hash families ⋮ Partial covering arrays: algorithms and asymptotics ⋮ Delta-systems and qualitative (in)dependence ⋮ The vertex Turán density in 3-ary \(n\)-cubes ⋮ Some Turán type results on the hypercube ⋮ Quantifying fault recovery in multiprocessor systems ⋮ On \(n\)-column 0,1-matrices with all \(k\)-projections surjective

This page was built for publication: Subcube fault-tolerance in hypercubes