Perfect broadcasting in unlabeled networks

Discrete Applied Mathematics

Volumn 87, Issue 1-3, 1998, Pages 33-47

  Diks, Krzysztof ^a   Kranakis, Evangelos ^b   Pelc, Andrzej ^c  

^a UNIVERSITY OF WARSAW   (Poland)

^b CARLETON UNIVERSITY   (Canada)

^c UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

Broadcasting; Message complexity; Unlabeled network

Indexed keywords

EID: 0002057533     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00047-X     Document Type: Article

References (15)

1. D. Angluin, Local and global properties in networks of processors, Proc. 12th Annual ACM Symp. on Theory of Computing, 1980, pp. 82-93.
2. H. Attiya, M. Snir, Better computing on the anonymous ring, J. Algorithms 12 (1991) 204-238.
3. H. Attiya, M. Snir, M. Warmuth, Computing on an anonymous ring, J. ACM 35 (1988) 845-875.
4. P. Boldi, S. Shammah, S. Vigna, P. Gemmell, B. Codenotti, J. Simon, Symmetry breaking in anonymous networks: characterizations, Proc. 4th Israel Symp. on Theory of Computing and Systems, 1996, pp. 16-26.
5. P. Flocchini, B. Mans, N. Santoro, Sense of direction: formal definitions and properties, Proc. 1st Int. Conf. on Structural Information and Communication Complexity (1994) 9-34, Carleton University Press, 1995.
6. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
7. S.M. Hedetniemi, S.T. Hedetniemi, A.L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988) 319-349.
8. E. Kranakis, Symmetry and computability in anonymous networks: a brief survey, Proc. 3rd Internat. Conf. on Structural Information and Communication Complexity (SIROCCO '96), Carleton University Press, 1997, pp. 1-16.
9. E. Kranakis, D. Krizanc, Distributed computing on anonymous hypercube networks, J. Algorithms 23 (1997) 32-50.
10. E. Kranakis, D. Krizanc, J. van der Berg, Computing Boolean functions on anonymous networks, Inform, and Comput. 114 (1994) 214-236.
11. S. Moran, M.K. Warmuth, Gap theorems for distributed computation, Proc. 5th ACM Symp. on Principles of Distributed Computing, 1986, pp. 131-140.
12. N. Santoro, Sense of direction, topological awareness, and communication complexity, ACM SIGACT News 16 (1984) 50-56.
13. G. Tel, Introduction to Distributed Algorithms, Cambridge University Press, Cambridge, 1996.
14. P.-K. Wong, Cages - a survey, J. Graph Theory 6 (1982) 1-22.
15. M. Yamashita, T. Kameda, Computing on an anonymous network, Proc. 7th Annual ACM Symp. on Principles of Distributed Computing, 1988, pp. 117-130.