Abstract
Entringer and Slater /1/ considered the following communication problem: Suppose each of n≥2 points (persons) 1,2,...,n knows are item of information which is not known to all the others. They exchange information using telegrams arranged in consecutive rounds whereby in every round:
-
(1)
each point can either send or receive telegrams, i.e. it is impossible for a given point to send some and to receive other telegrams in the same round;
-
(2)
any pair r,s∈V={1,2,.,..,n} is allowed to communicate by a telegram, and if s sends a telegram to r, then in that round, r learns all information which s knows at this time;
-
(3)
every point can communicate with at most k different points (k≥1), i.e. depending on whether it is a sender or a receiver in that round the point can either send at most k telegrams or receive at most k telegrams.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. C. Entringer and P.J.Slater, Gossips and telegraphs, J. Franklin Inst. 307 (1979) 353–359.
W.Knödel, New gossips and telephones, Discrete Math. 13 (1975) 95.
R.Labahn and I.Warnke, Quick gossiping by telegraphs, submitted to: Discrete Math.
P.Schmitt, Spreading information by conferences, Discrete Math. 15 (1976) 305–306.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Physica-Verlag Heidelberg
About this chapter
Cite this chapter
Labahn, R., Warnke, I. (1990). Quick Gossiping by Multi-Telegraphs. In: Bodendiek, R., Henn, R. (eds) Topics in Combinatorics and Graph Theory. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-46908-4_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-46908-4_52
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-642-46910-7
Online ISBN: 978-3-642-46908-4
eBook Packages: Springer Book Archive