Abstract
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the system become faulty. Such a set is called an irreversible dynamo. This is modelled as spreading a message among individuals V in a community \(G=\left( V,E\right) \) where E represents the acquaintance relation. A particular individual will believe a message if some of the individual’s acquaintances believe the same and forward the believed messages to its neighbours. We are interested in finding the minimum set of initial individuals to be considered as convinced, called the min-seed, such that every individual in the community is finally convinced. We solve for min-seed on some special classes of graphs and then give an upper bound on the cardinality of the min-seed for arbitrary undirected graphs. We consider some interesting variants of the problem and analyse their complexities and give some approximate algorithms.
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
Chang, C.-L., Lyuu, Y.-D.: On irreversible dynamic monopolies in general graphs. CoRR abs/0904.2306 (2009)
Peleg, D.: Size bounds for dynamic monopolies. Discrete Applied Mathematics 86(2-3), 263–273 (1998)
Watts, D.: A simple model of global cascades on random networks. P. Natl. Acad. Sci. USA 99(9), 5766–5771 (2002)
Flocchini, P., Lodi, E., Luccio, F., Santoro, N.: Irreversible dynamos in tori. In: Pritchard, D., Reeve, J.S. (eds.) Euro-Par 1998. LNCS, vol. 1470, pp. 554–562. Springer, Heidelberg (1998)
Luccio, F., Pagli, L., Sanossian, H.: Irreversible dynamos in butterflies. In: Gavoille, C., Bermond, J.C., Raspaud, A. (eds.) SIROCCO, pp. 204–218. Carleton Scientific (1999)
Flocchini, P., Geurts, F., Santoro, N.: Optimal irreversible dynamos in chordal rings. Discrete Applied Mathematics 113(1), 23–42 (2001)
Chang, C.L., Lyuu, Y.D.: Spreading messages. Theor. Comput. Sci. 410(27-29), 2714–2724 (2009)
Chang, C.L., Lyuu, Y.D.: Spreading of messages in random graphs. In: Downey, R., Manyem, P. (eds.) Fifteenth Computing: The Australasian Theory Symposium (CATS 2009), Wellington, New Zealand, ACS. CRPIT, vol. 94, pp. 3–7 (2009)
Reddy, T., Krishna, S., Rangan, P.: Variants of spreading messages (2010), http://www.cse.iitm.ac.in/~tiru/tiru/Publications_files/var_12page.pdf
Feige, U.: A threshold of ln for approximating set cover. J. ACM 45(4), 634–652 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reddy, T.V.T., Krishna, D.S., Rangan, C.P. (2010). Variants of Spreading Messages. In: Rahman, M.S., Fujita, S. (eds) WALCOM: Algorithms and Computation. WALCOM 2010. Lecture Notes in Computer Science, vol 5942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11440-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-11440-3_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11439-7
Online ISBN: 978-3-642-11440-3
eBook Packages: Computer ScienceComputer Science (R0)