How robust is the n-cube?
作者： Bernd Becker , Hans-Ulrich Simon
DOI: 10.1016/0890-5401(88)90056-9
关键词:
摘要: … (i, j) iff procedure P checks whether subcube ,~iXj is faulty. If the resulting directed graph is … iXj. Reversely, given a colouring for Ge, to each colour class C of edges we associate the …
core.ac.uk
elsevier.com
sci-hub.se 参考文章(13)
K. Appel, W. Haken, Every planar map is four colorable. Part I: Discharging Illinois Journal of Mathematics. ,vol. 21, pp. 429- 490 ,(1977) , 10.1215/IJM/1256049011
Cai Mao-cheng, Solutions to Edmonds' and Katona's problems on families of separating subsets Discrete Mathematics. ,vol. 47, pp. 13- 21 ,(1983) , 10.1016/0012-365X(83)90068-7
Daniel J. Kleitman, Joel Spencer, Families of k-independent sets Discrete Mathematics. ,vol. 6, pp. 255- 262 ,(1973) , 10.1016/0012-365X(73)90098-8
F. R. K. Chung, M. R. Garey, Diameter bounds for altered graphs Journal of Graph Theory. ,vol. 8, pp. 511- 534 ,(1984) , 10.1002/JGT.3190080408
J. Hastad, T. Leighton, M. Newman, Reconfiguring a hypercube in the presence of faults symposium on the theory of computing. pp. 274- 284 ,(1987) , 10.1145/28395.28425
R. P. Dilworth, A Decomposition Theorem for Partially Ordered Sets Classic Papers in Combinatorics. ,vol. 51, pp. 139- 144 ,(2009) , 10.1007/978-0-8176-4842-8_10
J Schönheim, A generalization of results of P. Erdös, G. Katona, and D. J. Kleitman concerning Sperner's theorem Journal of Combinatorial Theory, Series A. ,vol. 11, pp. 111- 117 ,(1971) , 10.1016/0097-3165(71)90035-5
Franco P. Preparata, Jean Vuillemin, The cube-connected cycles: a versatile network for parallel computation Communications of The ACM. ,vol. 24, pp. 300- 309 ,(1981) , 10.1145/358645.358660
Siegel, A Model of SIMD Machines and a Comparison of Various Interconnection Networks IEEE Transactions on Computers. ,vol. 28, pp. 907- 917 ,(1979) , 10.1109/TC.1979.1675280
Emanuel Sperner, Ein Satz über Untermengen einer endlichen Menge Mathematische Zeitschrift. ,vol. 27, pp. 544- 548 ,(1928) , 10.1007/BF01171114