{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:29:13Z","timestamp":1767706153738,"version":"3.37.3"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100004316","name":"IBM","doi-asserted-by":"publisher","award":["0831903"],"award-info":[{"award-number":["0831903"]}],"id":[{"id":"10.13039\/100004316","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"US National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2017,3,1]]},"DOI":"10.1109\/tkde.2016.2527643","type":"journal-article","created":{"date-parts":[[2016,2,10]],"date-time":"2016-02-10T19:26:43Z","timestamp":1455132403000},"page":"543-555","source":"Crossref","is-referenced-by-count":36,"title":["Enumeration of Maximal Cliques from an Uncertain Graph"],"prefix":"10.1109","volume":"29","author":[{"given":"Arko Provo","family":"Mukherjee","sequence":"first","affiliation":[]},{"given":"Pan","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Srikanta","family":"Tirthapura","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447891"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020569"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/TKDE.2010.80","article-title":"Mining frequent subgraph patterns from uncertain graph data","volume":"22","author":"zou","year":"2010","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-008-0106-1"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.243"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.14778\/2002938.2002941"},{"key":"ref36","first-page":"535","article-title":"Fast reliability search in uncertain graphs","author":"khan","year":"0","journal-title":"Proc Intl Conf Extending Database Technology"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.11"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835885"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12026-8_14"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02760024"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920967"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1090191.1080108"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.201"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1038\/415141a"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.6.487"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.21236\/ADA455191"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btn036"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.1993.1074"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113288"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2004.01.056"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1101\/gr.2203804"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/nbt924"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/nbt1103"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0507841103"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1038\/nature03607"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl308"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.6.487"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2556612"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(79)90014-5"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0857-4_5"},{"key":"ref4","first-page":"15","article-title":"Managing uncertainty in social networks","volume":"30","author":"adar","year":"2007","journal-title":"IEEE Data Eng Bull"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CCNC.2005.1405152"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988727"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1754393.1754397"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350254"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.08.011"},{"key":"ref45","first-page":"260","article-title":"New algorithms for enumerating all maximal cliques","volume":"3111","author":"makino","year":"0","journal-title":"Proc Scandinavian Workshop Algorithms Theory"},{"year":"0","author":"leskovec","key":"ref48"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.Congress.2014.105"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458288"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20662-7_31"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/0206036"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/69\/7842711\/7404027-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7842711\/07404027.pdf?arnumber=7404027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:49:09Z","timestamp":1649443749000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7404027\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,1]]},"references-count":50,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2016.2527643","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":[[2017,3,1]]}}}