OPTIMUM BROADCASTING AND PERSONALIZED COMMUNICATION IN HYPERCUBES

被引:425
作者
JOHNSSON, SL [1 ]
HO, CT [1 ]
机构
[1] YALE UNIV,DEPT COMP SCI & ELECT ENGN,NEW HAVEN,CT 06520
关键词
36;
D O I
10.1109/12.29465
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:1249 / 1268
页数:20
相关论文
共 36 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER
[2]   DECOMPOSITION OF THE CARTESIAN SUM OF ONE CYCLE AND THE UNION OF 2 HAMILTONIAN CYCLES INTO HAMILTONIAN CYCLES [J].
AUBERT, J ;
SCHNEIDER, B .
DISCRETE MATHEMATICS, 1982, 38 (01) :7-16
[3]  
Bhatt S., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P274, DOI 10.1109/SFCS.1986.38
[4]  
BHATT SN, 1985, YALEUCSDRR443 YAL U
[5]  
BROWNING SA, 1980, CALTECH 1980TR3760 C
[6]   PARALLEL MATRIX AND GRAPH ALGORITHMS [J].
DEKEL, E ;
NASSIMI, D ;
SAHNI, S .
SIAM JOURNAL ON COMPUTING, 1981, 10 (04) :657-675
[7]  
Deshpande S. R., 1986, Proceedings of the 1986 International Conference on Parallel Processing (Cat. No.86CH2355-6), P661
[8]  
FISCHER MJ, 1972, EFFICIENCY EQUIVALEN, P153
[9]   HAMILTONIAN DECOMPOSITIONS OF PRODUCTS OF CYCLES [J].
FOREGGER, MF .
DISCRETE MATHEMATICS, 1978, 24 (03) :251-260
[10]  
FOX GC, 1986, CCP314 CALTECH TECH