{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:21Z","timestamp":1725544041959},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114397"},{"type":"electronic","value":"9783642114403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_22","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T16:03:36Z","timestamp":1265126616000},"page":"240-251","source":"Crossref","is-referenced-by-count":6,"title":["Variants of Spreading Messages"],"prefix":"10.1007","author":[{"given":"T. V. Thirumala","family":"Reddy","sequence":"first","affiliation":[]},{"given":"D. Sai","family":"Krishna","sequence":"additional","affiliation":[]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Chang, C.-L., Lyuu, Y.-D.: On irreversible dynamic monopolies in general graphs. CoRR\u00a0abs\/0904.2306 (2009)"},{"issue":"2-3","key":"22_CR2","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0166-218X(98)00043-2","volume":"86","author":"D. Peleg","year":"1998","unstructured":"Peleg, D.: Size bounds for dynamic monopolies. Discrete Applied Mathematics\u00a086(2-3), 263\u2013273 (1998)","journal-title":"Discrete Applied Mathematics"},{"issue":"9","key":"22_CR3","doi-asserted-by":"publisher","first-page":"5766","DOI":"10.1073\/pnas.082090499","volume":"99","author":"D. Watts","year":"2002","unstructured":"Watts, D.: A simple model of global cascades on random networks. P. Natl. Acad. Sci. USA\u00a099(9), 5766\u20135771 (2002)","journal-title":"P. Natl. Acad. Sci. USA"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/BFb0057901","volume-title":"Euro-Par\u201998 Parallel Processing","author":"P. Flocchini","year":"1998","unstructured":"Flocchini, P., Lodi, E., Luccio, F., Santoro, N.: Irreversible dynamos in tori. In: Pritchard, D., Reeve, J.S. (eds.) Euro-Par 1998. LNCS, vol.\u00a01470, pp. 554\u2013562. Springer, Heidelberg (1998)"},{"key":"22_CR5","unstructured":"Luccio, F., Pagli, L., Sanossian, H.: Irreversible dynamos in butterflies. In: Gavoille, C., Bermond, J.C., Raspaud, A. (eds.) SIROCCO, pp. 204\u2013218. Carleton Scientific (1999)"},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(00)00388-7","volume":"113","author":"P. Flocchini","year":"2001","unstructured":"Flocchini, P., Geurts, F., Santoro, N.: Optimal irreversible dynamos in chordal rings. Discrete Applied Mathematics\u00a0113(1), 23\u201342 (2001)","journal-title":"Discrete Applied Mathematics"},{"issue":"27-29","key":"22_CR7","doi-asserted-by":"publisher","first-page":"2714","DOI":"10.1016\/j.tcs.2009.03.032","volume":"410","author":"C.L. Chang","year":"2009","unstructured":"Chang, C.L., Lyuu, Y.D.: Spreading messages. Theor. Comput. Sci.\u00a0410(27-29), 2714\u20132724 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR8","unstructured":"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.\u00a094, pp. 3\u20137 (2009)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Reddy, T., Krishna, S., Rangan, P.: Variants of spreading messages (2010), http:\/\/www.cse.iitm.ac.in\/~tiru\/tiru\/Publications_files\/var_12page.pdf","DOI":"10.1007\/978-3-642-11440-3_22"},{"issue":"4","key":"22_CR10","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln for approximating set cover. J. ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11440-3_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:34Z","timestamp":1606185634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}