{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T16:22:30Z","timestamp":1780590150944,"version":"3.54.1"},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2017,12,1]]},"DOI":"10.1109\/tpds.2017.2735405","type":"journal-article","created":{"date-parts":[[2017,8,3]],"date-time":"2017-08-03T14:10:43Z","timestamp":1501769443000},"page":"3501-3510","source":"Crossref","is-referenced-by-count":41,"title":["High Performance Exact Triangle Counting on GPUs"],"prefix":"10.1109","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3025-8227","authenticated-orcid":false,"given":"Mauro","family":"Bisson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Massimiliano","family":"Fatica","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"606","author":"schank","year":"2005","journal-title":"Finding Counting and Listing All Triangles in Large Graphs an Experimental Study"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2475270"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/15M1027826"},{"key":"ref13","year":"0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"ref16","article-title":"SNAP Datasets: Stanford large network dataset collection","author":"leskovec","year":"2014"},{"key":"ref17","first-page":"529","article-title":"Patric: A\n parallel algorithm for counting triangles in massive networks","author":"arifuzzaman","year":"2013","journal-title":"Proc ACM Int Conf Inf Knowl Manag"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2015.75"},{"key":"ref3","first-page":"1","article-title":"Fast triangle counting on the GPU","author":"green","year":"2014","journal-title":"Proc 4th Workshop Irregular Appl Archit Algorithms"},{"key":"ref6","article-title":"Counting triangles in massive graphs with mapReduce","author":"kolda","year":"2013","journal-title":"CoRR"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2009.120"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2700395"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11224"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2016.108"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2915516.2915521"},{"key":"ref9","article-title":"Thrust: A paralle template library for cuda","author":"hoberock","year":"2009"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/8103836\/08000612.pdf?arnumber=8000612","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:28Z","timestamp":1641987568000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8000612\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,1]]},"references-count":17,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2017.2735405","relation":{},"ISSN":["1045-9219"],"issn-type":[{"value":"1045-9219","type":"print"}],"subject":[],"published":{"date-parts":[[2017,12,1]]}}}