{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T01:40:07Z","timestamp":1744854007576,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642346101"},{"type":"electronic","value":"9783642346118"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34611-8_26","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T08:42:25Z","timestamp":1350895345000},"page":"249-261","source":"Crossref","is-referenced-by-count":4,"title":["Minimum Weight Dynamo and Fast Opinion Spreading"],"prefix":"10.1007","author":[{"given":"Sara","family":"Brunetti","sequence":"first","affiliation":[]},{"given":"Gennaro","family":"Cordasco","sequence":"additional","affiliation":[]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[]},{"given":"Elena","family":"Lodi","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Quattrociocchi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Bermond, J.C., Bond, J., Peleg, D., Perennes, S.: Tight bounds on the size of 2-monopolies. In: SIROCCO, pp. 170\u2013179 (1996)"},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/S0166-218X(02)00241-X","volume":"127","author":"J.C. Bermond","year":"2003","unstructured":"Bermond, J.C., Bond, J., Peleg, D., Perennes, S.: The power of small coalitions in graphs. Discrete Applied Mathematics\u00a0127(3), 399\u2013414 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"26_CR3","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1137\/S0097539795283619","volume":"27","author":"J.C. Bermond","year":"1998","unstructured":"Bermond, J.C., Gargano, L., Rescigno, A.A., Vaccaro, U.: Fast Gossiping by Short Messages. SIAM J. on Computing\u00a027(4), 917\u2013941 (1998)","journal-title":"SIAM J. on Computing"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Brunetti, S., Lodi, E., Quattrociocchi, W.: Dynamic monopolies in colored tori. In: IPDPS Workshops, pp. 626\u2013631 (2011)","DOI":"10.1109\/IPDPS.2011.194"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N. Chen","year":"2009","unstructured":"Chen, N.: On the approximability of influence in social networks. SIAM J. Discret. Math.\u00a023, 1400\u20131415 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: KDD 2001: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511761942"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S1570-8667(03)00022-4","volume":"1","author":"P. Flocchini","year":"2003","unstructured":"Flocchini, P., Kr\u00e1lovi\u010d, R., Ru\u017ei\u010dka, P., Roncato, A., Santoro, N.: On time versus size for monotone dynamic monopolies in regular topologies. J. of Discrete Algorithms\u00a01(2), 129\u2013150 (2003)","journal-title":"J. of Discrete Algorithms"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Granovetter, M.: Economic action and social structure: the problem of embeddedness. American Journal of Sociology\u00a091 (1985)","DOI":"10.1086\/228311"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/956750.956769","volume-title":"KDD 2003: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"D. Kempe","year":"2003","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: KDD 2003: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146. ACM, New York (2003)"},{"issue":"45","key":"26_CR11","doi-asserted-by":"publisher","first-page":"6371","DOI":"10.1016\/j.tcs.2011.08.004","volume":"412","author":"T. Kulich","year":"2011","unstructured":"Kulich, T.: Dynamic monopolies with randomized starting configuration. Theor. Comput. Sci.\u00a0412(45), 6371\u20136381 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Linial, N., Peleg, D., Rabinovich, Y., Saks, M.: Sphere packing and local majorities in graphs. In: ISTCS, pp. 141\u2013149. IEEE Computer Soc. Press (1993)","DOI":"10.1109\/ISTCS.1993.253475"},{"issue":"0","key":"26_CR13","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/S1571-0653(04)00555-4","volume":"15","author":"S. Mishra","year":"2003","unstructured":"Mishra, S., Rao, S.B.: Minimum monopoly in regular and tree graphs. Electronic Notes in Discrete Mathematics\u00a015(0), 126 (2003)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Nayak, A., Pagli, L., Santoro, N.: Efficient construction of catastrophic patterns for vlsi reconfigurable arrays with bidirectional links. In: ICCI, pp. 79\u201383 (1992)","DOI":"10.1109\/ICCI.1992.227700"},{"issue":"2-3","key":"26_CR15","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":"2","key":"26_CR16","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0304-3975(01)00055-X","volume":"282","author":"D. Peleg","year":"2002","unstructured":"Peleg, D.: Local majorities, coalitions and monopolies in graphs: a review. Theor. Comput. Sci.\u00a0282(2), 231\u2013257 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Valente, T.W.: Network models of the diffusion of innovations. Hampton Press (1995)","DOI":"10.1007\/BF00240425"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34611-8_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T01:22:37Z","timestamp":1744852957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34611-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642346101","9783642346118"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34611-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}