Variants of Spreading Messages
- Cite this paper as:
- 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
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.
KeywordsVertex Cover Bipartite Graphs Approximate Algorithms Fault Tolerance NP-complete
Unable to display preview. Download preview PDF.