{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T16:14:00Z","timestamp":1780416840859,"version":"3.54.1"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Italian Ministry of University and Research through the Efficient Algorithms for HArnessing Networked Data under PRIN Project","award":["20174LF3T8"],"award-info":[{"award-number":["20174LF3T8"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3040673","type":"journal-article","created":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T20:56:11Z","timestamp":1606424171000},"page":"219233-219243","source":"Crossref","is-referenced-by-count":7,"title":["Zuckerli: A New Compressed Representation for Graphs"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3495-1325","authenticated-orcid":false,"given":"Luca","family":"Versari","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1322-4164","authenticated-orcid":false,"given":"Iulia-Maria","family":"Comsa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alessio","family":"Conte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.09.010"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064012"},{"key":"ref12","first-page":"679","article-title":"Compact representations of separable graphs","author":"blandford","year":"2003","journal-title":"Proc 6th Ann ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref14","article-title":"Asymmetric numeral systems","author":"duda","year":"2009","journal-title":"arXiv 0902 0271"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref16","first-page":"112","article-title":"JPEG XL next-generation image compression architecture and coding tools","volume":"11137","author":"alakuijala","year":"2019","journal-title":"Applications of Digital Image Processing"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1967.5493"},{"key":"ref18","article-title":"Data compression using zopfli","author":"alakuijala","year":"2013"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90023-X"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2002.999950"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2004.1281504"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23169-8_42"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2001.917151"},{"key":"ref8","first-page":"18","article-title":"K 2-trees for compact Web graph representation","author":"brisaboa","year":"2009","journal-title":"Proc Int Symp String Proc Inf Ret"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3243176.3243198"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2018.00031"},{"key":"ref1","article-title":"Survey and taxonomy of lossless graph compression and space-efficient graph representations","author":"besta","year":"2018"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3390\/a2031031"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939862"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557049"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2577304"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/978-3-319-07959-2_28","article-title":"From theory to practice: Plug and play with succinct data structures","author":"gog","year":"2014","journal-title":"Proc of the 13th Int Symp on Experimental Algorithms"},{"key":"ref25","article-title":"A block-sorting lossless data compression algorithm","author":"burrows","year":"1994"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09272613.pdf?arnumber=9272613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T23:05:31Z","timestamp":1643151931000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9272613\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3040673","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}