INFORMATION DISSEMINATION IN TREES

被引：128

作者：

SLATER, PJ

COCKAYNE, EJ

HEDETNIEMI, ST

机构：

[1] UNIV VICTORIA,DEPT MATH,VICTORIA V8W 2Y2,BC,CANADA

[2] UNIV OREGON,DEPT COMP & INFORMAT SCI,EUGENE,OR 97403

来源：

关键词：

D O I：

10.1137/0210052

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：692 / 701

页数：10

共 12 条

[1] Baker B., 1972, DISCRETE MATH, V2, P191, DOI DOI 10.1016/0012-365X(72)90001-5
[2] BERMAN G, 1973, DISCRETE MATH, V4, P91
[3] COCKAYNE E, CSTR7814 U OR COMP S
[4] COCKAYNE EJ, 1977, 8TH P SE C COMB GRAP, P658
[5] MINIMUM BROADCAST GRAPHS
FARLEY, A
HEDETNIEMI, S
MITCHELL, S
PROSKUROWSKI, A
[J]. DISCRETE MATHEMATICS, 1979, 25 (02) : 189 - 193
[6] MINIMAL BROADCAST NETWORKS
FARLEY, AM
[J]. NETWORKS, 1979, 9 (04) : 313 - 332
[7] Garey Michael R., 1979, COMPUTERS INTRACTABI
[8] HEDETNIEMI ST, 1980, J COMBINATORICS INFO, V5, P119
[9] JOHNSON DS, 1978, COMMUNICATION MAY
[10] NEW GOSSIPS AND TELEPHONES
KNODEL, W
[J]. DISCRETE MATHEMATICS, 1975, 13 (01) : 95 - 95