{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:33Z","timestamp":1750306353572,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,18]],"date-time":"2016-07-18T00:00:00Z","timestamp":1468800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,18]]},"DOI":"10.1145\/2949689.2949715","type":"proceedings-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T15:03:00Z","timestamp":1467990180000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Bermuda"],"prefix":"10.1145","author":[{"given":"Dongqing","family":"Xiao","sequence":"first","affiliation":[{"name":"Worcester Polytechnic Institute, Worcester, MA, U.S.A"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Eltabakh","sequence":"additional","affiliation":[{"name":"Worcester Polytechnic Institute, Worcester, MA, U.S.A"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangnan","family":"Kong","sequence":"additional","affiliation":[{"name":"Worcester Polytechnic Institute, Worcester, MA, U.S.A"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/647904.739463"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505545"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2487984"},{"key":"e_1_3_2_1_4_1","volume-title":"A subquadratic triad census algorithm for large sparse networks with small maximum degree. Social networks","author":"Batagelj V.","year":"2001","unstructured":"V. Batagelj and A. Mrvar . A subquadratic triad census algorithm for large sparse networks with small maximum degree. Social networks , 2001 . V. Batagelj and A. Mrvar. A subquadratic triad census algorithm for large sparse networks with small maximum degree. Social networks, 2001."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401898"},{"key":"e_1_3_2_1_6_1","author":"Berry J.","year":"2011","unstructured":"J. Berry , B. Hendrickson , R. LaViolette , and C. Phillips . Tolerating the community detection resolution limit with edge weighting. Physical Review E , 2011 . J. Berry, B. Hendrickson, R. LaViolette, and C. Phillips. Tolerating the community detection resolution limit with edge weighting. Physical Review E, 2011.","journal-title":"Physical Review E"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142388"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.032093399"},{"key":"e_1_3_2_1_11_1","volume-title":"Graphx: Graph processing in a distributed dataflow framework. GRADES,SIGMOD workshop","author":"Gonzalez J.","year":"2014","unstructured":"J. Gonzalez , R. Xin , A. Dave , and D. Crankshaw . Graphx: Graph processing in a distributed dataflow framework. GRADES,SIGMOD workshop , 2014 . J. Gonzalez, R. Xin, A. Dave, and D. Crankshaw. Graphx: Graph processing in a distributed dataflow framework. GRADES,SIGMOD workshop, 2014."},{"key":"e_1_3_2_1_12_1","volume-title":"OSDI","author":"Gonzalez J. E.","year":"2012","unstructured":"J. E. Gonzalez , Y. Low , H. Gu , D. Bickson , and C. Guestrin . Powergraph: Distributed graph-parallel computation on natural graphs . OSDI , 2012 . J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Powergraph: Distributed graph-parallel computation on natural graphs. OSDI, 2012."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487581"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2691190.2691193"},{"key":"e_1_3_2_1_15_1","volume-title":"Finding a minimum circuit in a graph","author":"Itai A.","year":"1978","unstructured":"A. Itai and M. Rodeh . Finding a minimum circuit in a graph . SIAM , 1978 . A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM, 1978."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2007.4601909"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588563"},{"key":"e_1_3_2_1_19_1","volume-title":"OSDI","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. Blelloch , and C. Guestrin . Graphchi: Large-scale graph computation on just a pc . OSDI , 2012 . A. Kyrola, G. Blelloch, and C. Guestrin. Graphchi: Large-scale graph computation on just a pc. OSDI, 2012."},{"key":"e_1_3_2_1_20_1","volume-title":"LSDR-IR workshop","author":"Lin J.","year":"2009","unstructured":"J. Lin . The curse of zipf and limits to parallelization: A look at the stragglers problem in mapreduce . LSDR-IR workshop , 2009 . J. Lin. The curse of zipf and limits to parallelization: A look at the stragglers problem in mapreduce. LSDR-IR workshop, 2009."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_3_2_1_23_1","volume-title":"The American Statistician","author":"Oehlert G. W.","year":"1992","unstructured":"G. W. Oehlert . A note on the delta method . The American Statistician , 1992 . G. W. Oehlert. A note on the delta method. The American Statistician, 1992."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662017"},{"key":"e_1_3_2_1_25_1","volume-title":"Instruction-based reuse-distance prediction for effective cache management","author":"Petoumenos P.","year":"2009","unstructured":"P. Petoumenos and G. Keramidas . Instruction-based reuse-distance prediction for effective cache management . 2009 . P. Petoumenos and G. Keramidas. Instruction-based reuse-distance prediction for effective cache management. 2009."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535570.2488334"},{"key":"e_1_3_2_1_28_1","volume-title":"Algorithmic aspects of triangle-based network analysis. Phd in computer science","author":"Schank T.","year":"2007","unstructured":"T. Schank . Algorithmic aspects of triangle-based network analysis. Phd in computer science , 2007 . T. Schank. Algorithmic aspects of triangle-based network analysis. Phd in computer science, 2007."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588557"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963491"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815410"},{"key":"e_1_3_2_1_33_1","volume-title":"Hadoop: The definitive guide","author":"White T.","year":"2010","unstructured":"T. White . Hadoop: The definitive guide . 2010 . T. White. Hadoop: The definitive guide. 2010."}],"event":{"name":"SSDBM '16: Conference on Scientific and Statistical Database Management","acronym":"SSDBM '16","location":"Budapest Hungary"},"container-title":["Proceedings of the 28th International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2949689.2949715","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2949689.2949715","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:00Z","timestamp":1750222560000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2949689.2949715"}},"subtitle":["An Efficient MapReduce Triangle Listing Algorithm for Web-Scale Graphs"],"short-title":[],"issued":{"date-parts":[[2016,7,18]]},"references-count":33,"alternative-id":["10.1145\/2949689.2949715","10.1145\/2949689"],"URL":"https:\/\/doi.org\/10.1145\/2949689.2949715","relation":{},"subject":[],"published":{"date-parts":[[2016,7,18]]},"assertion":[{"value":"2016-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}