{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:55:28Z","timestamp":1752231328201,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319131221"},{"type":"electronic","value":"9783319131238"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13123-8_4","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T11:45:54Z","timestamp":1415965554000},"page":"34-46","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Computation of the Weighted Clustering Coefficient"],"prefix":"10.1007","author":[{"given":"Silvio","family":"Lattanzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"4_CR1","unstructured":"Applying social network analysis to the information in cvs repositories. In: 1st International Workshop on Mining Software Repositories (MSR)"},{"key":"4_CR2","unstructured":"Barrat, A., Barthlemy, M., Pastor-Satorras, R., Vespignani, A.: The architecture of complex weighted networks. Proceedings of the National Academy of Sciences of the United States of America"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: KDD 2008 (2008)","DOI":"10.1145\/1401890.1401898"},{"key":"4_CR4","unstructured":"Bollobs, B.: Mathematical results on scale-free random graphs. In: Handbook of Graphs and Networks"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Budak, C., Agrawal, D., El Abbadi, A.: Structural trend analysis for online social networks. In: VLDB 2011 (2011)","DOI":"10.14778\/2021017.2021022"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Buriol, L., Frahling, G., Leonardi, S., Marchetti-Spaccamela, A., Sohler, C.: Counting triangles in data streams. In: PODS 2006 (2006)","DOI":"10.1145\/1142351.1142388"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Castillo, C., Donato, D., Becchetti, L., Boldi, P., Leonardi, S., Santini, M., Vigna, S.: A reference collection for web spam. SIGIR 2006 (2006)","DOI":"10.1145\/1189702.1189703"},{"key":"4_CR8","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. In: OSDI 2004 (2004)"},{"key":"4_CR9","unstructured":"Fagiolo, G.: Clustering in complex directed networks. Phys. Rev. E."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Hardiman, S.J., Katzir, L.: Estimating clustering coefficients and size of social networks via random walk. In: WWW 2013 (2013)","DOI":"10.1145\/2488388.2488436"},{"key":"4_CR11","unstructured":"Hintsanen, P., Toivonen, H.: Finding reliable subgraphs from large probabilistic graphs. Data Min. Knowl. Discov."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Hintsanen, P., Toivonen, H.: Finding reliable subgraphs from large probabilistic graphs. Data Min. Knowl. Discov. (2008)","DOI":"10.1007\/s10618-008-0106-1"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Jha, M., Seshadhri, C., Pinar, A.: A space efficient streaming algorithm for triangle counting using the birthday paradox. In: KDD 2013 (2013)","DOI":"10.1145\/2487575.2487678"},{"key":"4_CR14","unstructured":"Kalna, G., Higham, D.J.: Clustering coefficients for weighted networks. In: Symposium on Network Analysis in Natural Sciences and Engineering"},{"key":"4_CR15","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 (2010)","DOI":"10.1145\/1772690.1772751"},{"key":"4_CR16","unstructured":"Latapy, M.: Main-memory triangle computations for very large (sparse(power-law)) graphs. Theoretical Computer Science"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Horvitz, E.: Planetary-scale views on a large instant-messaging network. In: WWW 2008 (2008)","DOI":"10.1145\/1367497.1367620"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Liberty, E.: Simple and deterministic matrix sketches. In: KDD 2014 (2014)","DOI":"10.1145\/2487575.2487623"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"056131","DOI":"10.1103\/PhysRevE.70.056131","volume":"70","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J.: Analysis of weighted networks. Phys. Rev. E 70, 056131 (2004)","journal-title":"Phys. Rev. E"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"2566","DOI":"10.1073\/pnas.012582999","volume":"99","author":"MEJ Newman","year":"2002","unstructured":"Newman, M.E.J., Watts, D.J., Strogatz, S.H.: Random graph models of social networks. Proc. Natl. Acad. Sci. USA 99, 2566\u20132572 (2002)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"4_CR21","unstructured":"Onnela, J.-P., Saram\u00e4ki, J.,\u00a0Kert\u00e9sz, J., Kaski, K.: Intensity and coherence of motifs in weighted complex networks. Physical Review E"},{"key":"4_CR22","unstructured":"Opsahl, T., Panzarasa, P.: Clustering in weighted networks. Social Networks"},{"key":"4_CR23","unstructured":"Pagh, R., Tsourakakis, C.E.: Colorful triangle counting and a mapreduce implementation"},{"key":"4_CR24","unstructured":"Saram\u00e4ki, J., Kivel\u00e4, M., Onnela, J.-P., Kaski, K., Kertesz, J.: Generalizations of the clustering coefficient to weighted complex networks. Physical Review E"},{"key":"4_CR25","unstructured":"Schank, T., Wagner, D.: Approximating clustering coefficient and transitivity. Journal of Graph Algorithms and Applications"},{"key":"4_CR26","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":"Thomas Schank","year":"2005","unstructured":"Schank, Thomas, Wagner, Dorothea: Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study. In: Nikoletseas, Sotiris E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 606\u2013609. Springer, Heidelberg (2005)"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Suri, S., Vassilvitskii, S.: Counting triangles and the curse of the last reducer. In: WWW 2011 (2011)","DOI":"10.1145\/1963405.1963491"},{"key":"4_CR28","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 2009 (2009)","DOI":"10.1145\/1557019.1557111"},{"key":"4_CR29","unstructured":"Tsourakakis, C.E., Kolountzakis, M.N., Miller, G.L.: Triangle sparsifiers. J. Graph Algorithms Appl."},{"key":"4_CR30","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature"},{"key":"4_CR31","unstructured":"Zhang, B., Horvath, S., et al.: A general framework for weighted gene co-expression network analysis. Statistical Applications in Genetics and Molecular Biology"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zhang, Z., Guan, J., Zhou, S.: Analytic solution to clustering coefficients on weighted networks. arXiv preprint arXiv:0911.0476 (2009)","DOI":"10.1088\/1742-5468\/2010\/03\/P03013"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13123-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T14:30:16Z","timestamp":1675348216000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13123-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319131221","9783319131238"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13123-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}