{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:14:22Z","timestamp":1768108462015,"version":"3.49.0"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2016,8,1]],"date-time":"2016-08-01T00:00:00Z","timestamp":1470009600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"HKRGC","award":["GRF-621413"],"award-info":[{"award-number":["GRF-621413"]}]},{"name":"HKRGC","award":["GRF-16211614"],"award-info":[{"award-number":["GRF-16211614"]}]},{"name":"HKRGC","award":["GRF-16200415"],"award-info":[{"award-number":["GRF-16200415"]}]},{"name":"Huawei Research Fund"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2016,8,1]]},"DOI":"10.1109\/tkde.2016.2556663","type":"journal-article","created":{"date-parts":[[2016,4,20]],"date-time":"2016-04-20T18:24:27Z","timestamp":1461176667000},"page":"2013-2026","source":"Crossref","is-referenced-by-count":33,"title":["Counting Triangles in Large Graphs by Random Sampling"],"prefix":"10.1109","volume":"28","author":[{"given":"Bin","family":"Wu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2178-3716","authenticated-orcid":false,"given":"Ke","family":"Yi","sequence":"additional","affiliation":[]},{"given":"Zhenguo","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_9"},{"key":"ref33","article-title":"Graphlab: A new framework for parallel machine learning","author":"low","year":"2010","journal-title":"arXiv 1006 4990"},{"key":"ref32","first-page":"135","article-title":"Pregel: A system for large-scale graph processing","author":"malewicz","year":"0","journal-title":"Proc ACM SIGMOD Int Conf Manage Data"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/100783066"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.07.025"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007602"},{"key":"ref36","article-title":"A simpler sublinear algorithm for approximating the triangle count","author":"seshadhri","year":"0","journal-title":"arXiv 1505 01927"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_54"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2745754.2745768"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2382577.2382581"},{"key":"ref13","article-title":"Algorithm engineering for large data sets hardware, software, algorithms","author":"dementiev","year":"2006"},{"key":"ref14","article-title":"An external memory algorithm for listing triangles","author":"menegola","year":"2010"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594552"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.007"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662017"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963491"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24082-9_83"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556569"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401898"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_53"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.032093399"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803390"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487678"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.056119"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.44"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463704"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2009.02.002"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.017"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/2535570.2488334"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557111"},{"key":"ref24","first-page":"623","article-title":"Reductions in streaming algorithms, with an application to counting triangles in graphs","author":"bar-yossef","year":"0","journal-title":"Proc Annu ACM-SIAM Symp Discrete Algorithm"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2012.625260"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142388"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/11533719_72"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7505473\/07457266.pdf?arnumber=7457266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:11:42Z","timestamp":1642003902000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7457266\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,1]]},"references-count":38,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2016.2556663","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2016,8,1]]}}}