{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:29Z","timestamp":1725558989659},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642142451"},{"type":"electronic","value":"9783642142468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14246-8_14","type":"book-chapter","created":{"date-parts":[[2010,7,6]],"date-time":"2010-07-06T14:09:26Z","timestamp":1278425366000},"page":"115-126","source":"Crossref","is-referenced-by-count":2,"title":["Clustering Coefficient Queries on Massive Dynamic Social Networks"],"prefix":"10.1007","author":[{"given":"Zhiyu","family":"Liu","sequence":"first","affiliation":[]},{"given":"Chen","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Qiong","family":"Zou","sequence":"additional","affiliation":[]},{"given":"Huayong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/1219092.1219097","volume":"54","author":"D. Achlioptas","year":"2007","unstructured":"Achlioptas, D., Mcsherry, F.: Fast computation of low-rank matrix approximations. J. ACM\u00a054(2), 9 (2007)","journal-title":"J. ACM"},{"issue":"3","key":"14_CR2","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":"14_CR3","unstructured":"Anderson, C.: The Long Tail: Why the Future of Business Is Selling Less of More. Hyperion, vol.\u00a012 (2004)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0378-8733(01)00035-1","volume":"23","author":"V. Batagelj","year":"2001","unstructured":"Batagelj, V., Mrvar, A.: A subquadratic triad census algorithm for large sparse networks with small maximum degree. Social Networks\u00a023, 237\u2013243 (2001)","journal-title":"Social Networks"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/1401890.1401898","volume-title":"KDD 2008: Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining","author":"L. Becchetti","year":"2008","unstructured":"Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: KDD 2008: Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 16\u201324. ACM, New York (2008)"},{"issue":"7","key":"14_CR6","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"14_CR7","first-page":"61","volume-title":"Leveraging social networks to fight spam","author":"P. Oscar Boykin","year":"2005","unstructured":"Oscar Boykin, P., Roychowdhury, V.P.: Leveraging social networks to fight spam, vol.\u00a038, pp. 61\u201368. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/1142351.1142388","volume-title":"PODS 2006: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","author":"L.S. Buriol","year":"2006","unstructured":"Buriol, L.S., Frahling, G., Leonardi, S., Marchetti-Spaccamela, A., Sohler, C.: Counting triangles in data streams. In: PODS 2006: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 253\u2013262. ACM, New York (2006)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/28395.28396","volume-title":"STOC 1987: Proceedings of the nineteenth annual ACM symposium on Theory of computing","author":"D. Coppersmith","year":"1987","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: STOC 1987: Proceedings of the nineteenth annual ACM symposium on Theory of computing, pp. 1\u20136. ACM, New York (1987)"},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation\u00a09(3), 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM Journal on Computing\u00a07(4), 413\u2013423 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR12","unstructured":"Ley, M.: Dblp bibliography"},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/TMC.2003.1195150","volume":"2","author":"D. Starobinski","year":"2003","unstructured":"Starobinski, D., Trachtenberg, A., Agarwal, S.: Efficient pda synchronization. IEEE Transactions on Mobile Computing\u00a02(1), 40\u201351 (2003)","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/ICDM.2008.72","volume-title":"ICDM 2008: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining","author":"C.E. Tsourakakis","year":"2008","unstructured":"Tsourakakis, C.E.: Fast counting of triangles in large real networks without counting: Algorithms and laws. In: ICDM 2008: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining, pp. 608\u2013617. IEEE Computer Society, Washington (2008)"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Drineas, P., Michelakis, E., Koutis, I., Faloutsos, C.: Spectral counting of triangles in power-law networks via element-wise sparsification. In: ASONAM, pp. 66\u201371 (2009)","DOI":"10.1109\/ASONAM.2009.32"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1145\/1557019.1557111","volume-title":"KDD 2009: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining","author":"C.E. Tsourakakis","year":"2009","unstructured":"Tsourakakis, C.E., Kang, U., Miller, G.L., Faloutsos, C.: Doulion: counting triangles in massive graphs with a coin. In: KDD 2009: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 837\u2013846. ACM, New York (2009)"},{"issue":"6684","key":"14_CR17","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of\u2019small-world\u2019networks. Nature\u00a0393(6684), 409\u2013410 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14246-8_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:22:14Z","timestamp":1619785334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14246-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642142451","9783642142468"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14246-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}