{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:24:33Z","timestamp":1743020673998,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157622"},{"type":"electronic","value":"9783642157639"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_37","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T09:48:44Z","timestamp":1282643324000},"page":"395-397","source":"Crossref","is-referenced-by-count":1,"title":["Brief Announcement: On Reversible and Irreversible Conversions"],"prefix":"10.1007","author":[{"given":"Mitre C.","family":"Dourado","sequence":"first","affiliation":[]},{"given":"Lucia Draque","family":"Penso","sequence":"additional","affiliation":[]},{"given":"Dieter","family":"Rautenbach","sequence":"additional","affiliation":[]},{"given":"Jayme L.","family":"Szwarcfiter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1002\/rsa.20295","volume":"36","author":"P. Balister","year":"2010","unstructured":"Balister, P., Bollob\u00e1s, B., Johnson, J.R., Walters, M.: Random majority percolation. Random Struct. Algorithms\u00a036, 315\u2013340 (2010)","journal-title":"Random Struct. Algorithms"},{"key":"37_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 Appl. Math.\u00a0127, 399\u2013414 (2003)","journal-title":"Discrete Appl. Math."},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/j.dam.2008.09.012","volume":"157","author":"P.A. Dreyer Jr.","year":"2009","unstructured":"Dreyer Jr., P.A., Roberts, F.S.: Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion. Discrete Appl. Math.\u00a0157, 1615\u20131627 (2009)","journal-title":"Discrete Appl. Math."},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1006\/inco.2001.3088","volume":"171","author":"Y. Hassin","year":"2001","unstructured":"Hassin, Y., Peleg, D.: Distributed probabilistic polling and applications to proportionate agreement. Inf. Comput.\u00a0171, 248\u2013268 (2001)","journal-title":"Inf. Comput."},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1137\/S0895480102408213","volume":"17","author":"N.H. Mustafa","year":"2004","unstructured":"Mustafa, N.H., Peke\u010d, A.: Listen to your neighbors: How (not) to reach a consensus. SIAM J. Discrete. Math.\u00a017, 634\u2013660 (2004)","journal-title":"SIAM J. Discrete. Math."},{"key":"37_CR7","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, 231\u2013257 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"37_CR8","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 Appl. Math.\u00a086, 263\u2013273 (1998)","journal-title":"Discrete Appl. Math."},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0166-218X(86)90067-3","volume":"13","author":"S. Poljak","year":"1986","unstructured":"Poljak, S., Turz\u00edk, D.: On pre-periods of discrete influence systems. Discrete Appl. Math.\u00a013, 33\u201339 (1986)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T23:13:04Z","timestamp":1676070784000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}