{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T11:34:13Z","timestamp":1790681653702,"version":"4.1.0"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019,8,1]]},"DOI":"10.1109\/tkde.2018.2858820","type":"journal-article","created":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T22:29:05Z","timestamp":1532384945000},"page":"1555-1568","source":"Crossref","is-referenced-by-count":9,"title":["On Efficient External-Memory Triangle Listing"],"prefix":"10.1109","volume":"31","author":[{"given":"Yi","family":"Cui","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8612-2863","authenticated-orcid":false,"given":"Di","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3876-1000","authenticated-orcid":false,"given":"Dmitri","family":"Loguinov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.012582999"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240060204"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.017"},{"key":"ref32","article-title":"Twitter graph","author":"kwak","year":"2010"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588563"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-10-318"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2014.2321150"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2326"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1541822.1541823"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735518"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2016.05.005"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/0207033"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335326"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/248210.248223"},{"key":"ref22","article-title":"The Markov chain simulation method for generating connected power law random graphs","author":"gkantsidis","year":"2003","journal-title":"Proceedings of the ACM-SIAM Workshop on Algorithm Engineering and Experiments"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2015.46"},{"key":"ref24","article-title":"Billion triples challenge data set","author":"harth","year":"2009"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733010"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463704"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt717"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms3241"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.14778\/1921071.1921073"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/2068816.2068841"},{"key":"ref56","year":"2002"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3034790"},{"key":"ref54","first-page":"645","article-title":"Subcubic equivalences between path, matrix, and triangle problems","author":"willians","year":"2010","journal-title":"Proc Annu IEEE Symp Foundations Comput Sci"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl038"},{"key":"ref52","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of ‘Small World’ networks","volume":"393","author":"watts","year":"1998","journal-title":"Nature"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90059-6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.056119"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973198.1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2010.557277"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020513"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/PL00012580"},{"key":"ref16","year":"0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2009.120"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.15"},{"key":"ref19","article-title":"IRL triangle datasets and code","author":"cui","year":"2016"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505545"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27801-6_30"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1214\/105051604000000693"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.09.051"},{"key":"ref7","first-page":"623","article-title":"Reductions in streaming algorithms, with an application to counting triangles in graphs","author":"bar-yossef","year":"2002","journal-title":"Proc 6th Ann ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963491"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401898"},{"key":"ref46","article-title":"Fast sorted-set intersection using SIMD instructions","author":"schlegel","year":"2011","journal-title":"Proceedings of ADMS"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_54"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2659480.2659494"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505563"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594552"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1022594.1022596"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662017"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8755525\/08417978.pdf?arnumber=8417978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:49:50Z","timestamp":1657745390000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8417978\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,1]]},"references-count":57,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2858820","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,1]]}}}