Subcube fault-tolerance in hypercubes
From MaRDI portal
Recommendations
Cited in
(21)- A lower bound on the size of \(k\)-neighborhood in generalized cubes
- A combinatorial analysis of subcube reliability in hypercubes
- Subcube fault tolerance in hypercube multiprocessors
- Subgraphs of a hypercube containing no small even cycles
- scientific article; zbMATH DE number 17938 (Why is no real title available?)
- On \(n\)-column 0,1-matrices with all \(k\)-projections surjective
- Recursive fault-tolerance of Fibonacci cube in hypercubes
- Some Turán type results on the hypercube
- How robust is the n-cube?
- Quantifying fault recovery in multiprocessor systems
- On the extremal combinatorics of the Hamming space
- Asymptotic and constructive methods for covering perfect hash families and covering arrays
- A method to increase the size of healthy subcubes set in a hypercube system with node or link failures
- On a covering problem in the hypercube
- A special case of set covering problems
- On the maximal connected component of a hypercube with faulty vertices III
- A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor
- Subspace restrictions and affine composition for covering perfect hash families
- The vertex Turán density in 3-ary \(n\)-cubes
- Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets
- Delta-systems and qualitative (in)dependence
This page was built for publication: Subcube fault-tolerance in hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207961)