{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T09:49:08Z","timestamp":1771494548391,"version":"3.50.1"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772124"],"award-info":[{"award-number":["61772124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Ind. Inf."],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1109\/tii.2019.2955144","type":"journal-article","created":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T21:18:04Z","timestamp":1574457484000},"page":"2726-2736","source":"Crossref","is-referenced-by-count":11,"title":["Effective and Efficient Dense Subgraph Query in Large-Scale Social Internet of Things"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1080-0859","authenticated-orcid":false,"given":"Yuhai","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5364-5844","authenticated-orcid":false,"given":"Xiangjun","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6798-9293","authenticated-orcid":false,"given":"Ying","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55699-4_25"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994538"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099626"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816657"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735484"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055337"},{"key":"ref16","article-title":"A survey of community search over big graphs","author":"fang","year":"2019"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12683-3_30"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2737600"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186141"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915217"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2832205"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137640"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612179"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2783933"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2852958"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247652"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2011.090911.111340"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746592"},{"key":"ref22","first-page":"1817","article-title":"Fully dynamic algorithm for Top-k densest subgraphs","author":"nasir","year":"2017","journal-title":"Proc CIKM"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741638"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2515579"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.95"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288961"},{"key":"ref25","first-page":"618","article-title":"Reducibility among combinatorial problems","volume":"40","author":"ka","year":"1972","journal-title":"J Symbolic Logic"}],"container-title":["IEEE Transactions on Industrial Informatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9424\/8966383\/08910344.pdf?arnumber=8910344","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T16:58:03Z","timestamp":1651078683000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8910344\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":27,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tii.2019.2955144","relation":{},"ISSN":["1551-3203","1941-0050"],"issn-type":[{"value":"1551-3203","type":"print"},{"value":"1941-0050","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4]]}}}