{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:48:14Z","timestamp":1740174494922,"version":"3.37.3"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-19-1-2329"],"award-info":[{"award-number":["N00014-19-1-2329"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-19-1-0161"],"award-info":[{"award-number":["FA9550-19-1-0161"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2021,7,1]]},"DOI":"10.1109\/tnse.2021.3091943","type":"journal-article","created":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T20:00:42Z","timestamp":1624564842000},"page":"2372-2387","source":"Crossref","is-referenced-by-count":3,"title":["A Scalable Markov Chain Framework for Influence Maximization in Arbitrary Networks"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8292-8838","authenticated-orcid":false,"given":"Juan","family":"S. Borrero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Majid","family":"Akhgar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavlo","family":"A. Krokhmal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"SNAP Datasets: Stanford large network dataset Collection","year":"2014","author":"leskovec","key":"ref39"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580218"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1043"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/070708111"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.06.003"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"ref35","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"erd\u00f5s","year":"1960","journal-title":"Publ Math Inst Hung Acad Sci"},{"journal-title":"MATLAB Version","year":"2019","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.08.021"},{"key":"ref40","first-page":"4292","article-title":"The network data repository with interactive graph analytics and visualization","author":"rossi","year":"2015","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2019.0012"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1288-y"},{"key":"ref13","first-page":"199","article-title":"Least-cost influence maximization on social networks","volume":"32","author":"g\u00fcnne\u00e7","year":"2020","journal-title":"INFORMS J Comput"},{"key":"ref14","first-page":"84","article-title":"A branch-and-cut approach for the least cost influence problem on social networks","volume":"76","author":"g\u00fcnne\u00e7","year":"2020"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01507-z"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915207"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1614694114"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2018.2873280"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2014.2310911"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(80)90201-3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-012-0262-1"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(80)90258-X"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-017-9958-x"},{"key":"ref29","first-page":"225","article-title":"On the max flow min cut theorem of networks","volume":"38","author":"dantzig","year":"2003","journal-title":"Linear Inequalities and Related Systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.2200\/S00527ED1V01Y201308DTM037"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2017.06.002"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.07.043"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144500371907"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/08073617X"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2015.v011a004"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MCS.2015.2495000","article-title":"Analysis and control of epidemics: A survey of spreading processes on complex networks","volume":"36","author":"nowzari","year":"2016","journal-title":"IEEE Control Syst Mag"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2007.4282394"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50806-1"},{"article-title":"Konect network dataset","year":"2020","author":"kunegis","key":"ref42"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1201\/9781315367910"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37210-0_40"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2007.09.015"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-34675-5"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of ‘small-world’ networks","volume":"393","author":"watts","year":"1998","journal-title":"Nature"},{"journal-title":"Adventures in Stochastic Processes","year":"1992","author":"resnick","key":"ref25"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488902\/9541107\/09464695.pdf?arnumber=9464695","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:53:38Z","timestamp":1652194418000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9464695\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,1]]},"references-count":43,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2021.3091943","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"type":"electronic","value":"2327-4697"},{"type":"electronic","value":"2334-329X"}],"subject":[],"published":{"date-parts":[[2021,7,1]]}}}