Access the full text.
Sign up today, get an introductory month for just $19.
D. Topkis (1985)
Concurrent Broadcast for Information DisseminationIEEE Transactions on Software Engineering, SE-11
Seress Seress
Gossips by conference callsStudia Sci.
D. West (1982)
GOSSIPING WITHOUT DUPLICATE TRANSMISSIONSSiam Journal on Algebraic and Discrete Methods, 3
A. Shimbel (1951)
Applications of matrix algebra to communication netsBulletin of Mathematical Biology, 13
(1983)
private communication
K. Dietz (1967)
Epidemics and Rumours: A Survey, 130
Z. Drezner, A. Barak (1984)
A probabilistic algorithm for scattering information in a multicomputer system
Y. Dalal (1977)
Broadcast protocols in packet switched computer networks
(1983)
Problems in broadcast-based communication
H. Landahl (1953)
On the spread of information with time and distanceBulletin of Mathematical Biology, 15
Chau Chau, Liestman Liestman (1985)
Constructing minimal broadcast networksJ. Comb. Inf. & Sys. Sci., 10
Hell Hell, Liestman Liestman
Broadcasting in one dimensionDisc. Appl. Math
D. Wall, S. Owicki (1983)
Construction of centered shortest-path trees in networksNetworks, 13
A. Rapoport (1953)
Spread of information through a population with socio-structural bias: I. Assumption of transitivityBulletin of Mathematical Biology, 15
R. Bumby (1981)
A Problem with TelephonesSiam Journal on Algebraic and Discrete Methods, 2
P. Slater, E. Cockayne, S. Hedetniemi (1981)
Information Dissemination in TreesSIAM J. Comput., 10
A. Frieze, G. Grimmett (1985)
The shortest-path problem for graphs with random arc-lengthsDiscret. Appl. Math., 10
H. Landau, A. Rapoport (1953)
Contribution to the mathematical theory of contagion and spread of information: I. Spread through a thoroughly mixed populationBulletin of Mathematical Biology, 15
(1974)
Goffman and V . A . Newill , Communication and epidemic processes M . C . Golumbic , The general gossip problem
Joseph Wald, C. Colbourn (1983)
Steiner trees, partial 2-trees, and minimum IFI networksNetworks, 13
W. Feller (1959)
An Introduction to Probability Theory and Its Applications
Arthur Liestman, D. Richards (1984)
Toward optimal gossiping schemes with conference callsDiscret. Appl. Math., 7
D. Topkis (1989)
All-to-All Broadcast by Flooding in Communications NetworksIEEE Trans. Computers, 38
N. Alon, A. Barak, U. Manber (1987)
On Disseminating Information Reliably without Broadcasting
David Boyd, J. Steele (1979)
Random exchanges of informationJournal of Applied Probability, 16
(1978)
A conjecrure concerning broadcasting in m-dimensional grid graphs
Farley Farley, Proskurowski Proskurowski (1980)
Gossiping in grid graphsJ. Combin. Inform. Systems Sci., 5
P. Schmitt (1976)
Spreading information by conferencesDiscret. Math., 15
Chau Chau, Liestman Liestman (1986)
Constructing fault‐tolerant minimal broadcast networksJ. Comb. Inf. & Sys. Sci., 11
Mitchell Mitchell, Hedetniemi Hedetniemi (1980)
A census of minimum broadcast graphsJ. Combin., Inform. & Systems Sci., 5
A. Farley (1981)
Networks immune to isolated failuresNetworks, 11
Murray Edelbert, P. Scheuermann
Optimal Broadcasting in Point-to-Point Computer Networks
R. Solomonoff (1952)
An exact method for the computation of the connectivity of random netsBulletin of Mathematical Biology, 14
A. Farley (1980)
Minimum-time line broadcast networksNetworks, 10
Berg Berg (1983)
Random contact processes, snowball sampling and factorial series distributionsJ. Appl. Probl., 20
J. Frauenthal (1980)
Mathematical Modeling in Epidemiology
S. Assmann, D. Kleitman (1983)
The number of rounds needed to exchange information within a graphDiscret. Appl. Math., 6
Á. Seress (1986)
Quick gossiping without duplicate transmissionsGraphs and Combinatorics, 2
G. Berman (1973)
The gossip problemDiscret. Math., 4
W. Goffman (1966)
Mathematical Approach to the Spread of Scientific Ideas—the History of Mast Cell ResearchNature, 212
D. Ling (1985)
Polling and receiving in graphs
Polling in tree networks ( abridged version )
V. Cane (1966)
A Note on the Size of Epidemics and the Number of People Hearing a RumourJournal of the royal statistical society series b-methodological, 28
Kenneth Lebensold (1973)
Efficient Communication by Phone CallsStudies in Applied Mathematics, 52
(1981)
Information spread in mesh-connected computers
G. Peck (1980)
Optimal Spreading in annDimensional Rectilinear GridStudies in Applied Mathematics, 62
H. Leavitt (1951)
Some effects of certain communication patterns on group performance.Journal of abnormal psychology, 46 1
B. Pittel (1987)
On spreading a rumorSiam Journal on Applied Mathematics, 47
D. Miklós, M. Newman, Á. Seress, D. West (1988)
The addition game: an abstraction of a communication problemDiscret. Math., 68
Gentleman Gentleman (1978)
Some complexity results for matrix computationsJ. Assoc. Computing Mach., 25
F. Harary, A. Schwenk (1974)
Efficiency of dissemination of information in one‐way and two‐way communication networksSystems Research and Behavioral Science, 19
D. Kleitman, J. Shearer (1980)
Further gossip problemsDiscret. Math., 30
Ko Ko (1979)
On a conjecture concerning broadcasting in grid graphs, preliminary reportNotices Amer. Math. Soc., 26
A. Farley, S. Hedetniemi, Sandra Mitchell, A. Proskurowski (1979)
Minimum broadcast graphsDiscret. Math., 25
F. Scoy (1976)
Parallel algorithms in cellular spaces.
G. Osei, J. Thompson (1977)
The supersession of one rumour by anotherJournal of Applied Probability, 14
W. Gentleman (1978)
Some Complexity Results for Matrix Computations on Parallel ProcessorsJ. ACM, 25
Cederbaum Cederbaum (1980)
On the spread of information in communication netsMatrix and Tensor Quart., 30
F. Harary, A. Schwenk (1974)
The communication problem on graphs and digraphsJournal of The Franklin Institute-engineering and Applied Mathematics, 297
R. Haddad, S. Roy, A. Schäffer (1987)
On gossiping with faulty telephone linesSiam Journal on Algebraic and Discrete Methods, 8
Miklos Miklos, Newman Newman, Seress Seress, West West (1988)
The addition game: A variant of gossiping without duplicationDiscr. Math., 68
D. West (1982)
A class of solutions to the gossip problem, part IIDiscret. Math., 40
A. Farley (1980)
Broadcast Time in Communication NetworksSiam Journal on Applied Mathematics, 39
Dodd Dodd, Staff Staff (1952)
Testing message diffusion in C‐VilleResearch Studies of the State College of Washington, 20
S. Even, Oded Goldreich, S. Moran, Po Tong (1984)
On the np-completeness of certain network testing problemsNetworks, 14
A. Proskurowski (1981)
Minimum Broadcast TreesIEEE Transactions on Computers, C-30
W. Knödel (1975)
New gossips and telephonesDiscret. Math., 13
Moon Moon (1972)
Random exchanges of informationNieuw Arch. Wisk., 20
(1984)
Broadcasting in grid graphs with given neighborhood templates
Goffman Goffman, Newill Newill (1967)
Communication and epidemic processesProc. Royal Soc., A, 298
R. Solomonoff, A. Rapoport (1951)
Connectivity of random netsBulletin of Mathematical Biology, 13
G. Burosch, Waleri Gorlow, R. Labahn, M. Szegedy (1984)
The Telephone Problem for Connected GraphsJ. Inf. Process. Cybern., 20
A. Rapoport (1953)
Spread of information through a population with socio-structural bias: II. Various models with partial transitivityBulletin of Mathematical Biology, 15
D. West (1982)
A class of solutions to the gossip problem, part IDiscret. Math., 39
Arthur Liestman, J. Peters (1988)
Broadcast Networks of Bounded DegreeSIAM J. Discret. Math., 1
(1987)
Epidemic algorithms for replicated database management
(1971)
On a telephone problem
(1979)
Broadcasting by decomposing trees into paths of bounded length
Á. Seress (1983)
Gossiping old ladiesDiscret. Math., 46
Y. Dalal, R. Metcalfe (1978)
Reverse path forwarding of broadcast packetsCommun. ACM, 21
H. Landau (1954)
The distribution of completion times for random communication in a task-oriented groupBulletin of Mathematical Biology, 16
D. Daley, D. Kendall (1964)
Epidemics and RumoursNature, 204
Burosch Burosch, Gorlow Gorlow, Labahn Labahn, Szegedy Szegedy (1984)
The telephone problem for connected graphsElektron. Informationsverarb. u. Kybernet., 20
(1975)
The Marhematical Theory of Infectious Diseases and its Applications, 2nd Ed
Harary Harary, Schwenk Schwenk (1974)
Efficiency of dissemination of information in one‐way and two‐way communication networksBehavioral Sci., 19
Alex Bavelas (1950)
Communication Patterns in Task‐Oriented GroupsJournal of the Acoustical Society of America, 22
D. Richards, Arthur Liestman (1988)
Generalizations of broadcasting and gossipingNetworks, 18
A. Unwin (1982)
Stochastic Models for Social Processes (3rd Edition)Journal of the Operational Research Society, 33
A. Rapoport (1954)
Spread of information through a population with socio-structural bias: III. Suggested experimental proceduresBulletin of Mathematical Biology, 16
R. Dunstan (1982)
The rumour processJournal of Applied Probability, 19
D. Wall (1980)
Mechanisms for broadcast and selective broadcast
W. Kermack, À. Mckendrick (1927)
A contribution to the mathematical theory of epidemicsProceedings of The Royal Society A: Mathematical, Physical and Engineering Sciences, 115
(1965)
Stochastic rumours
(1980)
Optimal multi-message broadcasting in complete graphs
A. Farley, A. Proskurowski (1982)
Networks immune to isolated line failuresNetworks, 12
Asthur Farley (1979)
Minimal broadcast networksNetworks, 9
Arthur Liestman (1985)
Fault-tolerant broadcast graphsNetworks, 15
C. Colbourn, A. Proskurowski (1984)
Concurrent Transmissions in Broadcast Networks
J. Vuillemin (1978)
A data structure for manipulating priority queuesCommun. ACM, 21
A. Farley, A. Proskurowski (1981)
Broadcasting in Trees with Multiple OriginatorsSiam Journal on Algebraic and Discrete Methods, 2
A. Rapoport, L. Rebhun (1952)
On the mathematical theory of rumor spreadBulletin of Mathematical Biology, 14
P. Scheuermann, G. Wu (1984)
Heuristic Algorithms for Broadcasting in Point-to-Point Computer NetworksIEEE Transactions on Computers, C-33
K. Berman, M. Hawrylycz (1986)
Telephone problems with failuresSiam Journal on Algebraic and Discrete Methods, 7
D. Daley (1967)
Concerning the spread of news in a population of individuals who never forget.The Bulletin of mathematical biophysics, 29 2
A. Rapoport (1951)
NETS WITH DISTANCE BIASBulletin of Mathematical Biology, 13
R. Entringer, P. Slater (1979)
Gossips and telegraphsJournal of The Franklin Institute-engineering and Applied Mathematics, 307
Klarner Klarner (1981)
Mathematical crystal growth IDiscret. Appl. Math., 3
A. Hajnal, E. Milner, E. Szemerédi (1972)
A Cure for the Telephone DiseaseCanadian Mathematical Bulletin, 15
B. Baker, R. Shostak (1972)
Gossips and telephonesDiscret. Math., 2
(1941)
The addition game: A variant
W. Goffman, V. Newill (1964)
Generalization of Epidemic Theory: An Application to the Transmission of IdeasNature, 204
Labahn Labahn (1986)
The telephone problem for treesElektron. Informationsverarb. u. Kybernet., 22
Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping every person in the network knows a unique item of information and needs to communicate it to everyone else. In broadcasting one individual has an item of information which needs to be communicated to everyone else. We review the results that have been obtained on these and related problems.
Networks: An International Journal – Wiley
Published: Dec 1, 1988
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get an introductory month for just $19.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.