MINIMAL BROADCAST NETWORKS

被引：77

作者：

FARLEY, AM

机构：

[1] University of Oregon Eugene, Eugene, Oregon

来源：

NETWORKS | 1979年 / 9卷 / 04期

关键词：

D O I：

10.1002/net.3230090404

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Broadcast refers to the process of information dissemination in a communication network whereby a message, originated by one member, is transmitted to all members of the network. A minimal broadcast network is a communication network in which a message can be broadcast in minimum time regardless of originator. This paper describes several classes of minimal broadcast networks. An algorithm is presented which constructs minimal broadcast networks which have approximately the minimum number of lines possible. Copyright © 1979 Wiley Periodicals, Inc., A Wiley Company

引用

页码：313 / 332

页数：20

共 8 条

[1] Boesch F.T., Felzer A.P., A general class of invulnerable graphs, Networks, 2, pp. 261-283, (1972)
[2] Hedetniemi S.T., Mitchell S.
[3] Farley A.M., Hedetniemi S.T., Proskurowski A., Mitchell S., Minimum broadcast graphs, Discrete Mathematics, 25, pp. 189-193, (1979)
[4] Proskurowski A.
[5] Slater P.J., Cockayne E.J., Hedetniemi S.T.
[6] Baker B., Shostak R., Gossips and telephones, Discrete Mathematics, 2, pp. 191-194, (1972)
[7] Berman G., The gossip problem (Note), Discrete Mathematics, 4, (1973)
[8] Knodel W., New gossips and telephones (Note), Discrete Mathematics, 13, (1975)

← 1 →