THE NUMBER OF ROUNDS NEEDED TO EXCHANGE INFORMATION WITHIN A GRAPH

被引:3
作者
ASSMANN, SF
KLEITMAN, DJ
机构
关键词
D O I
10.1016/0166-218X(83)90065-3
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:117 / 125
页数:9
相关论文
共 10 条
[1]  
Baker B., 1972, DISCRETE MATH, V2, P191, DOI DOI 10.1016/0012-365X(72)90001-5
[2]   A PROBLEM WITH TELEPHONES [J].
BUMBY, RT .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1981, 2 (01) :13-18
[3]  
CEDERBAUM I, 1980, MATRIX TENSOR QUART, V30, P101
[4]   CURE FOR TELEPHONE DISEASE [J].
HAJNAL, A ;
SZEMERED.E ;
MILNER, EC .
CANADIAN MATHEMATICAL BULLETIN, 1972, 15 (03) :447-&
[5]   EFFICIENCY OF DISSEMINATION OF INFORMATION IN ONE-WAY AND 2-WAY COMMUNICATION NETWORKS [J].
HARARY, F ;
SCHWENK, AJ .
BEHAVIORAL SCIENCE, 1974, 19 (02) :133-135
[6]   COMMUNICATION PROBLEM ON GRAPHS AND DIGRAPHS [J].
HARARY, F ;
SCHWENK, AJ .
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1974, 297 (06) :491-495
[7]  
Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364
[8]   FURTHER GOSSIP PROBLEMS [J].
KLEITMAN, DJ ;
SHEARER, JB .
DISCRETE MATHEMATICS, 1980, 30 (02) :151-156
[9]  
LEBENSOLD K, 1973, STUD APPL MATH, V52, P345
[10]  
TIJDEMAN R, 1971, NIEUW ARCH WISK, V19, P188