Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

WALCOM

2010

IEEE

2010

IEEE

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 = (V, E) 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 ﬁnding the minimum set of initial individuals to be considered as convinced, called the min-seed, such that every individual in the community is ﬁnally 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.

Related Content

Added |
31 Jan 2011 |

Updated |
31 Jan 2011 |

Type |
Journal |

Year |
2010 |

Where |
WALCOM |

Authors |
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan |

Comments (0)