{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:21:37Z","timestamp":1740169297218,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["20ZR1402700"],"award-info":[{"award-number":["20ZR1402700"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472339","61572421","61272124"],"award-info":[{"award-number":["61472339","61572421","61272124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3125198","type":"journal-article","created":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T21:28:51Z","timestamp":1635888531000},"page":"149338-149348","source":"Crossref","is-referenced-by-count":1,"title":["Efficient <i>(k, \u03b1)<\/i>-Maximal-Cliques Enumeration Over Uncertain Graphs"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9400-6029","authenticated-orcid":false,"given":"Jing","family":"Bai","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Donghua University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junfeng","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Donghua University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8617-8939","authenticated-orcid":false,"given":"Ming","family":"Du","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Donghua University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Zhong","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Donghua University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2543629"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622352"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113300"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939747"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.21236\/ADA455191"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401971"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1016.2013.02146"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104867"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915250"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CCNC.2005.1405152"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00015"},{"key":"ref13","first-page":"721","article-title":"Discovering large dense subgraphs in massive graphs","author":"gibson","year":"2005","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783299"},{"key":"ref15","article-title":"Large maximal cliques enumeration in large sparse graphs","author":"modani","year":"2009","journal-title":"Proc 15th Int Conf Manage Data"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113288"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447891"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00108"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807217"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2018.2831694"},{"key":"ref6","article-title":"On the relative efficiency of maximal clique enumeration algorithms, with application to high-throughput","author":"abu-khzam","year":"2005","journal-title":"Proc Comput Biol Int Conf Res Trends Sci Technol"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350254"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12683-3_30"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1996.3.289"},{"key":"ref2","first-page":"15","article-title":"Managing uncertainty in social networks","volume":"30","author":"adar","year":"2007","journal-title":"IEEE Data Eng Bull"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1754393.1754397"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09690-2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-18263"},{"journal-title":"Proceeding of the Second International Multi-Symposium of Computer and Computational Sciences","year":"2007","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3291602"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.01.026"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI.2015.114"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.98.2.404"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2013.08.008"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09599685.pdf?arnumber=9599685","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:21:48Z","timestamp":1662668508000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9599685\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3125198","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}