{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T05:50:55Z","timestamp":1738129855220,"version":"3.33.0"},"reference-count":89,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&D Program of China","award":["2021YFB3301303"],"award-info":[{"award-number":["2021YFB3301303"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202053","U2241211","62072034"],"award-info":[{"award-number":["62202053","U2241211","62072034"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1109\/tkde.2024.3514997","type":"journal-article","created":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T18:58:37Z","timestamp":1734116317000},"page":"1105-1125","source":"Crossref","is-referenced-by-count":0,"title":["Colorful Star Motif Counting: Concepts, Algorithms and Applications"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4364-0633","authenticated-orcid":false,"given":"Hongchao","family":"Qin","sequence":"first","affiliation":[{"name":"Department of Computer Science, Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gao","family":"Sen","sequence":"additional","affiliation":[{"name":"Computer Science, School of Computing, National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8658-6599","authenticated-orcid":false,"given":"Rong-Hua","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongzhi","family":"Chen","sequence":"additional","affiliation":[{"name":"ByteDance Infrastructure Team, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0247-9866","authenticated-orcid":false,"given":"Ye","family":"Yuan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0181-8379","authenticated-orcid":false,"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3433652"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00244"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3447397"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411862"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5987"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR56361.2022.9956557"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3108974"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2940246"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212740"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/21M1403291"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-20796-9_11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612697"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/3157794.3157802"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342645"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2016.7752210"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401962"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30165-5_30"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311909"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247652"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2543629"},{"article-title":"An O(m) algorithm for cores decomposition of networks","year":"2003","author":"Batagelj","key":"ref23"},{"volume-title":"Introduction to Algorithms, Second Edition","year":"2001","author":"Cormen","key":"ref24"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.017"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3588923"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3654922"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/14100018X"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s11634-010-0079-y"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/10.1.85"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00241"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3311398"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3239409"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3617331"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.158"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623655"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00015"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735484"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183736"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3324962"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482294"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461542"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3219096"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3033829"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3040762"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.14778\/3529337.3529340"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.14778\/3523210.3523214"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856323"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3589278"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.14778\/3598581.3598592"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2022.3174594"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3137955"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505751"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465323"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113288"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00108"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45995-2_51"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741640"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021927"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/3057742"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.14778\/3275536.3275540"},{"volume-title":"Finding a Maximum Density Subgraph","year":"1984","author":"Goldberg","key":"ref65"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741638"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783385"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783299"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-023-00805-0"},{"issue":"1","key":"ref71","first-page":"28","article-title":"Augmentation of densest subgraph finding unsupervised feature selection using shared nearest neighbor clustering","volume-title":"Algorithms","volume":"16","author":"Chugh","year":"2023"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-022-00927-1"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1145\/3589314"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.14778\/3636218.3636226"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3265009"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00115"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00008"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599306"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-90530-3_10"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-93409-5_46"},{"issue":"4","key":"ref81","article-title":"Induced colorful trees and paths in large chromatic graphs","volume-title":"Electron. J. Comb.","volume":"23","author":"Gy\u00e1rf\u00e1s","year":"2016"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2018.06.043"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/BIBE.2015.7367733"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-020-00590-4"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94776-1_40"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-016-0686-0"},{"key":"ref87","first-page":"5163","article-title":"Counting stars is constant-degree optimal for detecting any planted subgraph: Extended abstract","volume-title":"Proc. Conf. Learn. Theory","author":"Yu"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0287-3"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxad129"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/10855162\/10798523.pdf?arnumber=10798523","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T18:50:29Z","timestamp":1738090229000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10798523\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":89,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2024.3514997","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":[[2025,3]]}}}