{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:31:30Z","timestamp":1761489090950,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1109\/cdc.2012.6425841","type":"proceedings-article","created":{"date-parts":[[2013,2,8]],"date-time":"2013-02-08T17:05:08Z","timestamp":1360343108000},"page":"3426-3432","source":"Crossref","is-referenced-by-count":35,"title":["Robustness of complex networks with implications for consensus and contagion"],"prefix":"10.1109","author":[{"given":"Haotian","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shreyas","family":"Sundaram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02066689","article-title":"On the strength of connectedness of a random graph","volume":"12","author":"erdos","year":"1961","journal-title":"Acta Math Acad Sci Hungar"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/2185505.2185507"},{"key":"18","doi-asserted-by":"crossref","DOI":"10.1515\/9781400833993","author":"jackson","year":"2008","journal-title":"Social and Economic Networks"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/1967701.1967742"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332505"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2003.1195149"},{"journal-title":"Introduction to Graph Theory","year":"2001","author":"west","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/2185632.2185637"},{"key":"12","first-page":"5855","article-title":"Robustness of information diffusion algorithms to locally bounded adversaries","author":"zhang","year":"2012","journal-title":"Proceedings of the American Control Conference"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831470"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"journal-title":"Distributed Algorithms","year":"1996","author":"lynch","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/71.262588"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2088690"},{"journal-title":"Dissemination of Information in Communication Networks","year":"2005","author":"hromkovic","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011122126881"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1111\/1467-937X.00121"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/5925.5931"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2158130"}],"event":{"name":"2012 IEEE 51st Annual Conference on Decision and Control (CDC)","start":{"date-parts":[[2012,12,10]]},"location":"Maui, HI, USA","end":{"date-parts":[[2012,12,13]]}},"container-title":["2012 IEEE 51st IEEE Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6416474\/6425800\/06425841.pdf?arnumber=6425841","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T23:06:49Z","timestamp":1595372809000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6425841\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/cdc.2012.6425841","relation":{},"subject":[],"published":{"date-parts":[[2012,12]]}}}