EXPLICIT CONSTRUCTION OF LINEAR SIZED TOLERANT NETWORKS

被引:207
作者
ALON, N [1 ]
CHUNG, FRK [1 ]
机构
[1] BELL COMMUN RES,MORRISTOWN,NJ 07960
关键词
D O I
10.1016/0012-365X(88)90189-6
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:15 / 19
页数:5
相关论文
共 19 条
[1]  
Alon N., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P320, DOI 10.1109/SFCS.1984.715931
[2]   LAMBDA-1, ISOPERIMETRIC-INEQUALITIES FOR GRAPHS, AND SUPERCONCENTRATORS [J].
ALON, N ;
MILMAN, VD .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1985, 38 (01) :73-88
[3]   EIGENVALUES AND EXPANDERS [J].
ALON, N .
COMBINATORICA, 1986, 6 (02) :83-96
[4]   ON SIZE RAMSEY NUMBER OF PATHS, TREES, AND CIRCUITS .1. [J].
BECK, J .
JOURNAL OF GRAPH THEORY, 1983, 7 (01) :115-129
[5]  
Bhatt S., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P274, DOI 10.1109/SFCS.1986.38
[6]  
Burr S.A., 1979, ANN NY ACAD SCI, V328, P58
[7]  
CHUNG FRK, 1983, P LOND MATH SOC, V27, P203
[8]  
DAVENPORT H, 1980, MULTIPLICATIVE NUMBE, pCH7
[9]  
Erdos P., 1978, Periodica Mathematica Hungarica, V9, P145, DOI 10.1007/BF02018930
[10]  
Erdos P., 1975, Computers & Mathematics with Applications, V1, P365, DOI 10.1016/0898-1221(75)90037-1