{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:28:29Z","timestamp":1756992509724},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319556987"},{"type":"electronic","value":"9783319556994"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-55699-4_23","type":"book-chapter","created":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T03:56:53Z","timestamp":1490068613000},"page":"371-386","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Local Clustering Coefficient Estimation in Massive Graphs"],"prefix":"10.1007","author":[{"given":"Hao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yuanyuan","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,22]]},"reference":[{"key":"23_CR1","unstructured":"Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient algorithms for large-scale local triangle counting. TKDD 4(3) (2010). Article no. 13"},{"issue":"7","key":"23_CR2","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"10","key":"23_CR3","doi-asserted-by":"crossref","first-page":"e77455","DOI":"10.1371\/journal.pone.0077455","volume":"8","author":"D-B Chen","year":"2013","unstructured":"Chen, D.-B., Gao, H., L\u00fc, L., Zhou, T.: Identifying influential nodes in large-scale directed networks: the role of clustering. PloS one 8(10), e77455 (2013)","journal-title":"PloS one"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Chu, S., Cheng, J.: Triangle listing in massive networks and its applications. In: KDD, pp. 672\u2013680. ACM (2011)","DOI":"10.1145\/2020408.2020513"},{"issue":"4","key":"23_CR5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/MCSE.2009.120","volume":"11","author":"J Cohen","year":"2009","unstructured":"Cohen, J.: Graph twiddling in a mapreduce world. Comput. Sci. Eng. 11(4), 29\u201341 (2009)","journal-title":"Comput. Sci. Eng."},{"issue":"9","key":"23_CR6","doi-asserted-by":"crossref","first-page":"5825","DOI":"10.1073\/pnas.032093399","volume":"99","author":"J-P Eckmann","year":"2002","unstructured":"Eckmann, J.-P., Moses, E.: Curvature of co-links uncovers hidden thematic layers in the world wide web. PNAS 99(9), 5825\u20135829 (2002)","journal-title":"PNAS"},{"issue":"301","key":"23_CR7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Hu, X., Tao, Y., Chung, C.-W.: Massive graph triangulation. In: SIGMOD, pp. 325\u2013336. ACM (2013)","DOI":"10.1145\/2463676.2463704"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Jha, M., Seshadhri, C., Pinar, A.: A space-efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox. TKDD 9(3), 15:1\u201315:21 (2015)","DOI":"10.1145\/2700395"},{"issue":"5","key":"23_CR10","doi-asserted-by":"crossref","first-page":"S48","DOI":"10.1137\/13090729X","volume":"36","author":"TG Kolda","year":"2014","unstructured":"Kolda, T.G., Pinar, A., Plantenga, T., Seshadhri, C., Task, C.: Counting triangles in massive graphs with mapreduce. SISC 36(5), S48\u2013S77 (2014)","journal-title":"SISC"},{"issue":"1\u20132","key":"23_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1080\/15427951.2012.625260","volume":"8","author":"MN Kolountzakis","year":"2012","unstructured":"Kolountzakis, M.N., Miller, G.L., Peng, R., Tsourakakis, C.E.: Efficient triangle counting in large graphs via degree-based vertex partitioning. Internet Math. 8(1\u20132), 161\u2013185 (2012)","journal-title":"Internet Math."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.: What is Twitter, a social network or a news media? In: WWW 2010: Proceedings of the 19th International Conference on World wide web, pp. 591\u2013600. ACM, New York (2010)","DOI":"10.1145\/1772690.1772751"},{"issue":"1","key":"23_CR13","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.tcs.2008.07.017","volume":"407","author":"M Latapy","year":"2008","unstructured":"Latapy, M.: Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoret. Comput. Sci. 407(1), 458\u2013473 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR14","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Lim, Y., Kang, U.: MASCOT: memory-efficient and accurate sampling for counting local triangles in graph streams. In: KDD, pp. 685\u2013694 (2015)","DOI":"10.1145\/2783258.2783285"},{"issue":"5\/6","key":"23_CR16","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1108\/03684921111142359","volume":"40","author":"Y Lin","year":"2011","unstructured":"Lin, Y., Xiong, H., Chen, M., Ding, L., Cao, Y., Wang, G., Liu, M.: Dynamical model and analysis of cascading failures on the complex power grids. Kybernetes 40(5\/6), 814\u2013823 (2011)","journal-title":"Kybernetes"},{"issue":"10","key":"23_CR17","doi-asserted-by":"crossref","first-page":"e25190","DOI":"10.1371\/journal.pone.0025190","volume":"6","author":"N Masuda","year":"2011","unstructured":"Masuda, N.: Clustering in large networks does not promote upstream reciprocity. PloS one 6(10), e25190 (2011)","journal-title":"PloS one"},{"issue":"1","key":"23_CR18","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/2627692.2627694","volume":"43","author":"A McGregor","year":"2014","unstructured":"McGregor, A.: Graph stream algorithms: a survey. SIGMOD Rec. 43(1), 9\u201320 (2014)","journal-title":"SIGMOD Rec."},{"key":"23_CR19","unstructured":"Menegola, B.: An external memory algorithm for listing triangles (2010)"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York (2005)","DOI":"10.1017\/CBO9780511813603"},{"issue":"7","key":"23_CR21","doi-asserted-by":"crossref","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. 112(7), 277\u2013281 (2012)","journal-title":"Inf. Process. Lett."},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Park, H.-M., Chung, C.-W.: An efficient mapreduce algorithm for counting triangles in a very large graph. In: CIKM, pp. 539\u2013548. ACM (2013)","DOI":"10.1145\/2505515.2505563"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Park, H.-M., Silvestri, F., Kang, U., Pagh, R.: Mapreduce triangle enumeration with guarantees. In: CIKM, pp. 1739\u20131748. ACM (2014)","DOI":"10.1145\/2661829.2662017"},{"issue":"2","key":"23_CR24","doi-asserted-by":"crossref","first-page":"265","DOI":"10.7155\/jgaa.00108","volume":"9","author":"T Schank","year":"2005","unstructured":"Schank, T., Wagner, D.: Approximating clustering coefficient and transitivity. J. Graph Algorithms Appl. 9(2), 265\u2013275 (2005)","journal-title":"J. Graph Algorithms Appl."},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Serfling, R.J.: Probability inequalities for the sum in sampling without replacement. Ann. Stat. 2(1), 39\u201348 (1974)","DOI":"10.1214\/aos\/1176342611"},{"issue":"5","key":"23_CR26","doi-asserted-by":"crossref","first-page":"056109","DOI":"10.1103\/PhysRevE.85.056109","volume":"85","author":"C Seshadhri","year":"2012","unstructured":"Seshadhri, C., Kolda, T.G., Pinar, A.: Community structure and scale-free collections of erd\u0151s-r\u00e9nyi graphs. Phys. Rev. E 85(5), 056109 (2012)","journal-title":"Phys. Rev. E"},{"key":"23_CR27","unstructured":"Seshadhri, C., Pinar, A., Kolda, T.G.: Fast triangle counting through wedge sampling. In: SDM, vol. 4, p. 5. Citeseer (2013)"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Seshadhri, C., Pinar, A., Kolda, T.G.: Triadic measures on graphs: the power of wedge sampling. In: SDM, pp. 10\u201318. SIAM (2013)","DOI":"10.1137\/1.9781611972832.2"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Stefani, L.D., Epasto, A., Riondato, M., Upfal, E.: Tri\u00e8st: counting local and global triangles in fully-dynamic streams with fixed memory size. In: KDD, pp. 825\u2013834 (2016)","DOI":"10.1145\/2939672.2939771"},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"Suri, S., Vassilvitskii, S.: Counting triangles and the curse of the last reducer. In: WWW, pp. 607\u2013614. ACM (2011)","DOI":"10.1145\/1963405.1963491"},{"issue":"5","key":"23_CR31","doi-asserted-by":"crossref","first-page":"056102","DOI":"10.1103\/PhysRevE.81.056102","volume":"81","author":"D Trpevski","year":"2010","unstructured":"Trpevski, D., Tang, W.K., Kocarev, L.: Model for rumor spreading over networks. Phys. Rev. E 81(5), 056102 (2010)","journal-title":"Phys. Rev. E"},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E.: Fast counting of triangles in large real networks without counting: algorithms and laws. In: ICDM, pp 608\u2013617 (2008)","DOI":"10.1109\/ICDM.2008.72"},{"issue":"2","key":"23_CR33","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s13278-010-0001-9","volume":"1","author":"CE Tsourakakis","year":"2011","unstructured":"Tsourakakis, C.E., Drineas, P., Michelakis, E., Koutis, I., Faloutsos, C.: Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation. Soc. Netw. Anal. Mining 1(2), 75\u201381 (2011)","journal-title":"Soc. Netw. Anal. Mining"},{"key":"23_CR34","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Kang, U., Miller, G.L., Faloutsos, C.: Doulion: counting triangles in massive graphs with a coin. In: KDD, pp. 837\u2013846. ACM (2009)","DOI":"10.1145\/1557019.1557111"},{"issue":"6","key":"23_CR35","doi-asserted-by":"crossref","first-page":"703","DOI":"10.7155\/jgaa.00245","volume":"15","author":"CE Tsourakakis","year":"2011","unstructured":"Tsourakakis, C.E., Kolountzakis, M.N., Miller, G.L.: Triangle sparsifiers. J. Graph Algorithms Appl. 15(6), 703\u2013726 (2011)","journal-title":"J. Graph Algorithms Appl."},{"issue":"14","key":"23_CR36","doi-asserted-by":"crossref","first-page":"1559","DOI":"10.1016\/j.physleta.2011.02.052","volume":"375","author":"X Wu","year":"2011","unstructured":"Wu, X., Lu, H.: Cluster synchronization in the adaptive complex dynamical networks via a novel approach. Phys. Lett. A 375(14), 1559\u20131565 (2011)","journal-title":"Phys. Lett. A"},{"issue":"1","key":"23_CR37","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/2556609","volume":"8","author":"Z Yang","year":"2014","unstructured":"Yang, Z., Wilson, C., Wang, X., Gao, T., Zhao, B.Y., Dai, Y.: Uncovering social network sybils in the wild. TKDD 8(1), 2 (2014)","journal-title":"TKDD"}],"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-319-55699-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:48:30Z","timestamp":1568940510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55699-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319556987","9783319556994"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55699-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}