{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:12:44Z","timestamp":1746072764333,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642374494"},{"type":"electronic","value":"9783642374500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37450-0_23","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T05:41:52Z","timestamp":1366177312000},"page":"301-308","source":"Crossref","is-referenced-by-count":24,"title":["Parallel Triangle Counting over Large Graphs"],"prefix":"10.1007","author":[{"given":"Wenan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yu","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Zhigang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1146\/annurev.soc.27.1.415","volume":"27","author":"M. McPherson","year":"2001","unstructured":"McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: Homophily in social networks. Annual Review of Sociology\u00a027, 415\u2013444 (2001)","journal-title":"Annual Review of Sociology"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Eckmann, J.-P., Moses, E.: Curvature of co-links uncovers hidden thematic layers in the World Wide Web. Proc. of the National Academy of Science, 5825\u20135829 (2002)","DOI":"10.1073\/pnas.032093399"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Suri, S., Vassilvitskii, S.: Counting triangles and the curse of the last reducer. In: Proc. of WWW, pp. 607\u2013614 (2011)","DOI":"10.1145\/1963405.1963491"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Kang, U., Miller, G.L., et al.: DOULION: counting triangles in massive graphs with a coin. In: Proc. of KDD, pp. 837\u2013846 (2009)","DOI":"10.1145\/1557019.1557111"},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N. Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica\u00a017(3), 209\u2013223 (1997)","journal-title":"Algorithmica"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/11427186_54","volume-title":"Experimental and Efficient Algorithms","author":"T. Schank","year":"2005","unstructured":"Schank, T., Wagner, D.: Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 606\u2013609. Springer, Heidelberg (2005)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: Proc. of STOC, pp. 20\u201329 (1996)","DOI":"10.1145\/237814.237823"},{"issue":"3","key":"23_CR8","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10115-010-0291-2","volume":"26","author":"C.E. Tsourakakis","year":"2011","unstructured":"Tsourakakis, C.E.: Counting triangles in real-world networks using projections. Knowl. Inf. Syst.\u00a026(3), 501\u2013520 (2011)","journal-title":"Knowl. Inf. Syst."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Giugno, R., Shasha, D.: Graphgrep: A fast and universal method for querying graphs. In: Proc. of ICPR, pp. 112\u2013115 (2002)","DOI":"10.1109\/ICPR.2002.1048250"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Kang, U., Tong, H., Sun, J., et al.: Gbase: a scalable and general graph management system. In: Proc. of KDD, pp. 1091\u20131099 (2011)","DOI":"10.1145\/2020408.2020580"},{"issue":"7","key":"23_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ipl.2011.12.007","volume":"112","author":"R. Pagh","year":"2012","unstructured":"Pagh, R., Tsourakakis, C.E.: Colorful triangle counting and a mapreduce implementation. Inf. Process. Lett.\u00a0112(7), 277\u2013281 (2012)","journal-title":"Inf. Process. Lett."},{"key":"23_CR12","unstructured":"SNAP, http:\/\/snap.stanford.edu\/data\/soc-LiveJournal1.html"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37450-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T05:13:02Z","timestamp":1745989982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37450-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642374494","9783642374500"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37450-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}