{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:16:09Z","timestamp":1740132969645,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2018,5,1]]},"DOI":"10.1109\/tkde.2017.2780123","type":"journal-article","created":{"date-parts":[[2017,12,6]],"date-time":"2017-12-06T19:18:37Z","timestamp":1512587917000},"page":"880-894","source":"Crossref","is-referenced-by-count":7,"title":["Efficient Information Flow Maximization in Probabilistic Graphs"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2458-6651","authenticated-orcid":false,"given":"Christian","family":"Frey","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Zufle","sequence":"additional","affiliation":[]},{"given":"Tobias","family":"Emrich","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Renz","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.222"},{"key":"ref38","first-page":"745","article-title":"Defining and evaluating network communities based on ground-truth","author":"yang","year":"2012","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2009.2020120"},{"key":"ref32","first-page":"35","article-title":"Link discovery in graphs derived from biological databases","author":"sevon","year":"2006","journal-title":"Proc Int Conf Data Integr Life Sci"},{"key":"ref31","first-page":"275","article-title":"Network performance modeling and simulation. Chapter network\n reliability evaluation","author":"rubino","year":"1999"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775057"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758773"},{"key":"ref36","first-page":"436","article-title":"Does the internet increase, decrease, or\n supplement social capital? Social networks, participation, and community commitment","volume":"45","author":"wellman","year":"2001"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/98.878532"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.201"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447891"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988727"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2007.898572"},{"key":"ref13","first-page":"471","article-title":"The most reliable subgraph problem","author":"hintsanen","year":"0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/2002938.2002941"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13672-6_17"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref19","first-page":"535","article-title":"Fast reliability search in uncertain\n graphs","author":"khan","year":"2014","journal-title":"Proc Int Conf Extending Database Technol"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920967"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/24.285106"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1951365.1951408"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(88)90065-0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.3.516"},{"journal-title":"The Combinatorics of Network Reliability","year":"1987","author":"colbourn","key":"ref5"},{"key":"ref8","first-page":"17","article-title":"On the evolution of random graphs","author":"erd\u00f6s","year":"1960","journal-title":"Publ Math Inst Hungar Acad Sci"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398742"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0026-2714(75)90461-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/DRCN.2005.1563849"},{"key":"ref1","first-page":"15","article-title":"Managing uncertainty in social networks","volume":"30","author":"adar","year":"2007","journal-title":"IEEE Data Eng Bull"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.243"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"ref21","first-page":"133","article-title":"Realistic, mathematically tractable\n graph generation and evolution, using kronecker multiplication","author":"leskovec","year":"2005","journal-title":"Data Mining and Knowledge Discovery"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0268-8"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/TKDE.2010.80","article-title":"Mining frequent subgraph patterns from uncertain graph\n data","volume":"22","author":"zou","year":"2010","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref23","first-page":"539","article-title":"Learning to discover social circles in ego networks","author":"leskovec","year":"2012","journal-title":"Proc Int Conf Neural Inf Process"},{"journal-title":"Statistics for Engineers and Scientists","year":"2006","author":"navidi","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8329400\/08166795.pdf?arnumber=8166795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T06:58:24Z","timestamp":1643180304000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8166795\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,1]]},"references-count":41,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2017.2780123","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2018,5,1]]}}}