Highly Influenced

# How robust is the n-cube?

@article{Becker1986HowRI, title={How robust is the n-cube?}, author={Bernd Becker and Hans Ulrich Simon}, journal={27th Annual Symposium on Foundations of Computer Science (sfcs 1986)}, year={1986}, pages={283-291} }

- Published 1986 in 27th Annual Symposium on Foundations of Computer…
DOI:10.1016/0890-5401(88)90056-9

The n-cube network is called faulty if it contains any faulty processor or any faulty link. For any number k we are interested in the minimum number f(n, k) of faults, necessary for an adversary to make any (n-k)-dimensional subcube faulty. Reversely formulated: The existence of a (n-k)- dimensional nonfaulty subcube can be guaranteed, unless there are at least f(n,k) faults in the n-cube. In this paper several lower and upper bounds for f(n, k) are derived such that the resulting gaps are… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-5 of 5 references