How robust is the n-cube?

Information and Computation

Volumn 77, Issue 2, 1988, Pages 162-178

  Becker, Bernd ^a   Simon, Hans Ulrich ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000609153     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/0890-5401(88)90056-9     Document Type: Article

References (12)

1. Every planar map is 4-colourable
2. Solutions to Edmond's and Katona's problems on families of separating subsets
3. A decomposition theorem for partially ordered sets
4. Constructing O(n log n) size monotone formulae for the kth elementary symmetric polynomial of n Boolean variables
5. Reconfiguring a hypercube in the presence of faults
6. Families of k-independent sets
7. The indirect binary n-cube microprocessor array
8. The cube-connected cycles: A versatile network for parallel computation
9. A generalization of results of P Erdo¨s G Katona and D J Kleitman concerning Sperner's theorem
10. A model of SIMD mashines and a comparison of various interconnection networks
11. Ein Satzu¨ber Untermengen einer endlichen Menge