Abstract
Broadcasting is an information dissemination problem in a connected network, in which one node, called the originator, disseminates a message to all other nodes by placing a series of calls along the communication lines of the network. Once informed, the nodes aid the originator in distributing the message. Finding the minimum broadcast time of a vertex in an arbitrary graph is NP-complete. The problem is solved polynomially only for trees. It is proved that the complexity of the problem of determining the minimum broadcast time of any vertex in an arbitrary tree T = (V, E) is Θ|V|. In this paper we present an algorithm that determines the broadcast time of any originator in an arbitrary unicyclic graph G = (V, E) in O(|V|) time. This, combined with the obvious lower bound, gives a Θ(|V|) solution for the problem of broadcasting in unicyclic graphs. As a byproduct, we also find a broadcast center of the unicyclic graph (a vertex in G with the minimum broadcast time).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aiello, W., Chung, F., Lu, L.: Random evolution in massive graphs. In: FOCS 2001. Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 510–519 (2001)
Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Multicasting in Heterogeneous Networks. In: STOC 1998. Proc. of ACM Symp. on Theory of Computing (1998)
Beier, R., Sibeyn, J.F.: A powerful heuristic for telephone gossiping. In: SIROCCO 2000. Proc. of the 7th International Colloquium on Structural Information & Communication Complexity, L’Aquila, Italy, pp. 17–36 (2000)
Bermond, J.-C., Fraigniaud, P., Peters, J.: Antepenultimate broadcasting. Networks 26, 125–137 (1995)
Bermond, J.-C., Hell, P., Liestman, A.L., Peters, J.G.: Sparse broadcast graphs. Discrete Appl. Math. 36, 97–130 (1992)
Dinneen, M.J., Fellows, M.R., Faber, V.: Algebraic constructions of efficient broadcast networks. In: Mattson, H.F., Rao, T.R.N., Mora, T. (eds.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. LNCS, vol. 539, pp. 152–158. Springer, Heidelberg (1991)
Doar, M.B.: A better model for generating test networks. In: IEEE GLOBECOM 1996, London, IEEE Computer Society Press, Los Alamitos (1996)
Elkin, M., Kortsarz, G.: A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem. In: STOC 2002. Proc. of ACM Symp. on Theory of Computing, pp. 438–447 (2002)
Elkin, M., Kortsarz, G.: Sublogarithmic approximation for telephone multicast: path out of jungle. In: SODA 2003. Proc. of Symposium on Discrete Algorithms, Baltimore, Maryland, pp. 76–85 (2003)
Farley, A.M., Hedetniemi, S.T., Proskurowski, A., Mitchell, S.: Minimum broadcast graphs. Discrete Math. 25, 189–193 (1979)
Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. In: SIGAL 1990. Proc. of International Symposium on Algorithms, pp. 128–137 (1990)
Fraigniaud, P., Vial, S.: Approximation algorithms for broadcasting and gossiping. J. Parallel and Distrib. Comput. 43(1), 47–55 (1997)
Fraigniaud, P., Vial, S.: Heuristic Algorithms for Personalized Communication Problems in Point-to-Point Networks. In: SIROCCO 1997. Proc. of the 4th Colloquium on Structural Information and Communication Complexity, pp. 240–252 (1997)
Fraigniaud, P., Vial, S.: Comparison of Heuristics for One-to-All and All-to-All Communication in Partial Meshes. Parallel Processing Letters 9(1), 9–20 (1999)
Harutyunyan, H.A., Liestman, A.L.: More broadcast graphs. Discrete Math. 98, 81–102 (1999)
Harutyunyan, H.A., Shao, B.: An Efficient Heuristic for Broadcasting in Networks. Journal of Parallel and Distributed Computing (to appear)
Johnson, D., Garey, M.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA (1979)
Kortsarz, G., Peleg, D.: Approximation algorithms for minimum time broadcast. SIAM J. Discrete Math. 8, 401–427 (1995)
Ravi, R.: Rapid Rumor Ramification: Approximating the minimum broadcast time. In: FOCS 1994. Proc. of 35th Symposium on Foundation of Computer Science, pp. 202–213 (1994)
Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information dissemination in trees. SIAM J.Comput. 10(4), 692–701 (1981)
Scheuerman, P., Wu, G.: Heuristic Algorithms for Broadcasting in Point-to-Point Computer Network. IEEE Transactions on Computers C-33(9), 804–811 (1984)
Zegura, E.W., Calvert, K., Bhattacharjee, S.: How to model an internetwork. In: INFOCOM 1996. Proc. The IEEE Conf. on Computer Communications, San Francisco, CA, IEEE Computer Society Press, Los Alamitos (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Harutyunyan, H., Maraachlian, E. (2007). Linear Algorithm for Broadcasting in Unicyclic Graphs. In: Lin, G. (eds) Computing and Combinatorics. COCOON 2007. Lecture Notes in Computer Science, vol 4598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73545-8_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-73545-8_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73544-1
Online ISBN: 978-3-540-73545-8
eBook Packages: Computer ScienceComputer Science (R0)