|
[1] C. W. Chang, D. Kuo and C. H. Li, Generalized broadcasting and gossiping problem of graphs. preprint. [2] M. L. Chia, D. Kuo and M. F. Tung, The multiple originator broadcasting problem in graphs, Disc. Appl. Math. 155 (2007) 1188-1199. [3] P. Chinn, S. Hedetniemi and S. Mitchell, Multiple-message broadcasting in complete graphs. In Proc.Tenth SE Conf. on Combinatorics, Graph Theory and Computing. Utilitas Mathe-matica, Winnipeg, 1979, pp. 251-260. [4] E. J. Cockayne and A. Thomason, Optimal multi-message broadcasting in complete graphs. In Proc. Eleventh SE Conf. on Combinatorics, Graph Theory and Computing. Utilitas Mathematica, Winnipeg, 1980, pp. 181-199. [5] A. Farley, Broadcast time in communication networks. SIAM J. Appl. Math. 39 (1980) 385-390. [6] A. Farley and S. Hedetniemi, Broadcasting in grid graphs. In Proc. Ninth SE Conf. on Combinatorics, Graph Theory and Computing. Utilitas Mathematica, Winnipeg, 1987. [7] A. Farley and A. Proskurowski, Broadcasting in trees with multiple originators. SIAM J. Alg. Disc. Methods. 2 (1981)381-386. [8] M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Fran- cisco, 1979. [9] S. M. Hedetniemi and S. T. Hedetniemi, Broadcasting by de-composing trees into paths of bounded length. Technical Re-port CS-TR-79-16, University of Oregon, 1979. [10] S. M. Hedetniemi, S. T. Hedetniemi and A. L. Liestman, A Survey of gossiping and broadcasting in communication net- works, Networks 18 (1988), 319-349. [11] P. J. Slater, E. Cockayne and S. T. Hedetniemi, Information dissemination in trees.SIAM J. Comput. 10 (1981) 692-701.
|