{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T01:23:13Z","timestamp":1776993793275,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T00:00:00Z","timestamp":1464652800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF awards","award":["CCF-1017399 and OCI-1032859"],"award-info":[{"award-number":["CCF-1017399 and OCI-1032859"]}]},{"name":"UC Lab Fees Research Program Award","award":["12-LR-238449"],"award-info":[{"award-number":["12-LR-238449"]}]},{"name":"DARPA XDATA US Army award","award":["W911QX-12-C-0059"],"award-info":[{"award-number":["W911QX-12-C-0059"]}]},{"name":"DARPA STTR awards","award":["D14PC00023 and D15PC00010"],"award-info":[{"award-number":["D14PC00023 and D15PC00010"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,5,31]]},"DOI":"10.1145\/2915516.2915521","type":"proceedings-article","created":{"date-parts":[[2016,5,27]],"date-time":"2016-05-27T12:37:36Z","timestamp":1464352656000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["A Comparative Study on Exact Triangle Counting Algorithms on the GPU"],"prefix":"10.1145","author":[{"given":"Leyuan","family":"Wang","sequence":"first","affiliation":[{"name":"University of California, Davis, Davis, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yangzihao","family":"Wang","sequence":"additional","affiliation":[{"name":"University of California, Davis, Davis, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carl","family":"Yang","sequence":"additional","affiliation":[{"name":"University of California, Davis, Davis, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John D.","family":"Owens","sequence":"additional","affiliation":[{"name":"University of California, Davis, Davis, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002974.2002975"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2015.75"},{"key":"e_1_3_2_1_3_1","volume-title":"10th DIMACS implementation challenge--graph partitioning and graph clustering","author":"Center for Discrete Mathematics & Theoretical Computer Science.","year":"2011","unstructured":"Center for Discrete Mathematics & Theoretical Computer Science. 10th DIMACS implementation challenge--graph partitioning and graph clustering . Feb. 2011 . Center for Discrete Mathematics & Theoretical Computer Science. 10th DIMACS implementation challenge--graph partitioning and graph clustering. Feb. 2011."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2009.120"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28396"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699470"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.44"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2304576.2304621"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567634.2567635"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2688283.2688284"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"key":"e_1_3_2_1_13_1","volume-title":"From the birthday paradox to a practical sublinear space streaming algorithm for triangle counting. CoRR, abs\/1212.2264","author":"Jha M.","year":"2012","unstructured":"M. Jha , C. Seshadhri , and A. Pinar . From the birthday paradox to a practical sublinear space streaming algorithm for triangle counting. CoRR, abs\/1212.2264 , 2012 . M. Jha, C. Seshadhri, and A. Pinar. From the birthday paradox to a practical sublinear space streaming algorithm for triangle counting. CoRR, abs\/1212.2264, 2012."},{"key":"e_1_3_2_1_14_1","volume-title":"Counting triangles in massive graphs with mapreduce. CoRR, abs\/1301.5887","author":"Kolda T. G.","year":"2013","unstructured":"T. G. Kolda , A. Pinar , T. Plantenga , C. Seshadhri , and C. Task . Counting triangles in massive graphs with mapreduce. CoRR, abs\/1301.5887 , 2013 . T. G. Kolda, A. Pinar, T. Plantenga, C. Seshadhri, and C. Task. Counting triangles in massive graphs with mapreduce. CoRR, abs\/1301.5887, 2013."},{"key":"e_1_3_2_1_15_1","first-page":"133","volume-title":"Proceedings of the 39th International Conference on Very Large Data Bases, PVLDB'13","author":"Lee J.","year":"2013","unstructured":"J. Lee , W.-S. Han , R. Kasperovics , and J.-H. Lee . An in-depth comparison of subgraph isomorphism algorithms in graph databases . In Proceedings of the 39th International Conference on Very Large Data Bases, PVLDB'13 , pages 133 -- 144 . VLDB Endowment , 2013 . J. Lee, W.-S. Han, R. Kasperovics, and J.-H. Lee. An in-depth comparison of subgraph isomorphism algorithms in graph databases. In Proceedings of the 39th International Conference on Very Large Data Bases, PVLDB'13, pages 133--144. VLDB Endowment, 2013."},{"key":"e_1_3_2_1_16_1","unstructured":"J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014.  J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.47"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145832"},{"key":"e_1_3_2_1_19_1","volume-title":"Counting triangles in large graphs on GPU. CoRR, abs\/1503.00576","author":"Polak A.","year":"2015","unstructured":"A. Polak . Counting triangles in large graphs on GPU. CoRR, abs\/1503.00576 , 2015 . A. Polak. Counting triangles in large graphs on GPU. CoRR, abs\/1503.00576, 2015."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_54"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"e_1_3_2_1_24_1","first-page":"299","volume-title":"Proceedings of the 20th International Conference on Database Systems for Advanced Applications, DASFAA 2015","author":"Tran H.-N.","year":"2015","unstructured":"H.-N. Tran , J.-j. Kim , and B. He . Fast subgraph matching on large graphs using graphics processors. In M. Renz, C. Shahabi, X. Zhou, and A. M. Cheema, editors , Proceedings of the 20th International Conference on Database Systems for Advanced Applications, DASFAA 2015 , pages 299 -- 315 . Springer International Publishing, Cham , Apr. 2015 . H.-N. Tran, J.-j. Kim, and B. He. Fast subgraph matching on large graphs using graphics processors. In M. Renz, C. Shahabi, X. Zhou, and A. M. Cheema, editors, Proceedings of the 20th International Conference on Database Systems for Advanced Applications, DASFAA 2015, pages 299--315. Springer International Publishing, Cham, Apr. 2015."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557111"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311909"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/1921071.1921073"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851145"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516384"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920887"}],"event":{"name":"HPDC'16: The 25th International Symposium on High-Performance Parallel and Distributed Computing","location":"Kyoto Japan","acronym":"HPDC'16","sponsor":["University of Arizona University of Arizona","SIGARCH ACM Special Interest Group on Computer Architecture","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"]},"container-title":["Proceedings of the ACM Workshop on High Performance Graph Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2915516.2915521","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2915516.2915521","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:18Z","timestamp":1750222578000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2915516.2915521"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,31]]},"references-count":32,"alternative-id":["10.1145\/2915516.2915521","10.1145\/2915516"],"URL":"https:\/\/doi.org\/10.1145\/2915516.2915521","relation":{},"subject":[],"published":{"date-parts":[[2016,5,31]]},"assertion":[{"value":"2016-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}