×
Farley, A. M.

Minimal broadcast networks. (English) Zbl 0425.94025

Networks 9, 313-332 (1979).
Page: −5 −4 −3 −2 −1 ±0 +1 Show Scanned Page
scan of Zbl 0425.94025

Cited in 2 Reviews
Cited in 38 Documents

MSC:

94C15 Applications of graph theory to circuits and networks
90B18 Communication networks in operations research
68M10 Network design and communication in computer systems

Keywords:

information dissemination; communication network
Cite Review PDF
Full Text: DOI

References:

[1] Boesch, Networks 2 pp 261– (1972)
[2] and , ”A census of minimum broadcast graphs”, CS–TR–78–6, Computer Science Department, University of Oregon. · Zbl 0449.05034
[3] Farley, Discrete Mathematics 25 pp 189– (1979)
[4] ”Minimum broadcast trees”, in preparation.
[5] , and , ”Information dissemination in trees”, CS–TR–78–11, Computer Science Department, University of Oregon. · Zbl 0468.68064
[6] Baker, Discrete Mathematics 2 pp 191– (1972)
[7] Berman, Discrete Mathematics 4 pp 91– (1973)
[8] Knodel, Discrete Mathematics 13 pp 95– (1975)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.