{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:22Z","timestamp":1759638622485,"version":"3.37.3"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61762024","U1501252"],"award-info":[{"award-number":["61762024","U1501252"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004607","name":"Natural Science Foundation of Guangxi Province","doi-asserted-by":"publisher","award":["2017GXNSFDA198050","2016GXNSFAA380054"],"award-info":[{"award-number":["2017GXNSFDA198050","2016GXNSFAA380054"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2912172","type":"journal-article","created":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T21:41:02Z","timestamp":1556228462000},"page":"52945-52954","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Representation for Web and Social Network Graphs Based on ${K}^{2}$ -Tree"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8531-0125","authenticated-orcid":false,"given":"Fengying","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianlong","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0540-4659","authenticated-orcid":false,"given":"Rongsheng","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3390\/a2031031"},{"key":"ref11","first-page":"1","article-title":"Compression of Web and social graphs supporting neighbor and community queries","author":"hern\u00e1ndez","year":"2010","journal-title":"Proceedings of the 5th ACM Workshop on Social Network Mining and Analysis ACM"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290680"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-017-4087-5"},{"key":"ref14","first-page":"270","article-title":"Delta-K2-tree for compact representation of web graphs","author":"zhang","year":"2014","journal-title":"Proc Asia-Pacific Web Conf"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICRCICN.2016.7813655"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2015.7364035"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2017.8258020"},{"key":"ref18","first-page":"264","article-title":"Compressed representation of Web and social networks via dense subgraphs","author":"hern\u00e1ndez","year":"2012","journal-title":"Proc Int Symp String Proc Inf Ret"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0648-4"},{"journal-title":"The LAW Laboratory From the University of Milan","year":"2018","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2011.07.060"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/5.892708"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"journal-title":"The University of Chile’s FCWGR (Fast Compact Web Graph Representations) Project","year":"2018","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03784-9_3"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341547"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2004.1281504"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1841909.1841913"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557049"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063747"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298591"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050084"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050082"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035943"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3190654"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.08.003"},{"journal-title":"Survey and taxonomy of lossless graph compression and space-efficient graph representations","year":"2018","author":"besta","key":"ref25"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08694770.pdf?arnumber=8694770","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:40:17Z","timestamp":1628624417000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8694770\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2912172","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}