{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T05:49:18Z","timestamp":1748929758561,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,10,11]],"date-time":"2016-10-11T00:00:00Z","timestamp":1476144000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s11280-016-0420-2","type":"journal-article","created":{"date-parts":[[2016,10,11]],"date-time":"2016-10-11T04:45:14Z","timestamp":1476161114000},"page":"855-883","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Ranking weighted clustering coefficient in large dynamic graphs"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9331-5551","authenticated-orcid":false,"given":"Xuefei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zi","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,11]]},"reference":[{"key":"420_CR1","first-page":"354","volume":"17","author":"N Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17, 354\u2013364 (1997)","journal-title":"Algorithmica"},{"issue":"6","key":"420_CR2","first-page":"574","volume":"5","author":"A Angel","year":"2012","unstructured":"Angel, A., Koudas, N., Sarkas, N., Srivastava, D.: Dense subgraph maintenance under streaming edge weight updates for real-time story identification. PVLDB 5(6), 574\u2013585 (2012)","journal-title":"PVLDB"},{"issue":"5","key":"420_CR3","first-page":"454","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani, B., Kumar, R., Vassilvitskii, S.: Densest subgraph in streaming and mapreduce. PVLDB 5(5), 454\u2013465 (2012)","journal-title":"PVLDB"},{"key":"420_CR4","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, pp 16\u201324 (2008)","DOI":"10.1145\/1401890.1401898"},{"key":"420_CR5","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Gullo, F., Kaltenbrunner, A., Volkovich, Y.: Core decomposition of uncertain graphs. In: KDD, pp 1316\u20131325 (2014)","DOI":"10.1145\/2623330.2623655"},{"issue":"6","key":"420_CR6","doi-asserted-by":"crossref","first-page":"1934","DOI":"10.1037\/a0016902","volume":"35","author":"KYY Chan","year":"2009","unstructured":"Chan, K.Y.Y., Vitevitch, M.S.: The influence of the phonological neighborhood clustering coefficient on spoken word recognition. J. Exp. Psychol. Hum. Percept. Perform. 35(6), 1934\u20131949 (2009)","journal-title":"J. Exp. Psychol. Hum. Percept. Perform."},{"key":"420_CR7","doi-asserted-by":"crossref","unstructured":"Chu, S., Cheng, J.: Triangle listing in massive networks and its applications. In: KDD, pp. 672\u2013680 (2011)","DOI":"10.1145\/2020408.2020513"},{"key":"420_CR8","doi-asserted-by":"crossref","first-page":"S95","DOI":"10.1086\/228943","volume":"94","author":"JS Coleman","year":"1988","unstructured":"Coleman, J.S.: Social Capital in the Creation of Human Capital. Am. J. Sociol. 94, S95\u2013S120 (1988)","journal-title":"Am. J. Sociol."},{"key":"420_CR9","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: STOC, pp. 1\u20136 (1987)","DOI":"10.1145\/28395.28396"},{"key":"420_CR10","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press (2009)"},{"key":"420_CR11","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31, 182\u2013209 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"420_CR12","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.: Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on world wide web, pp 47\u201348. ACM (2011)","DOI":"10.1145\/1963192.1963217"},{"issue":"13","key":"420_CR13","doi-asserted-by":"crossref","first-page":"1618","DOI":"10.14778\/2536258.2536272","volume":"6","author":"X Huang","year":"2013","unstructured":"Huang, X., Cheng, H., Li, R.-H., Qin, L., Yu, J.X.: Top-k structural diversity search in large networks. Proc. VLDB Endow. 6(13), 1618\u20131629 (2013)","journal-title":"Proc. VLDB Endow."},{"key":"420_CR14","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: SIGMOD, pp 1311\u20131322 (2014)","DOI":"10.1145\/2588555.2610495"},{"issue":"4","key":"420_CR15","doi-asserted-by":"crossref","first-page":"276","DOI":"10.14778\/2856318.2856323","volume":"9","author":"X Huang","year":"2015","unstructured":"Huang, X., Lakshmanan, L.V., Yu, J.X., Cheng, H.: Approximate closest community search in networks. Proc. VLDB Endowment 9(4), 276\u2013287 (2015)","journal-title":"Proc. VLDB Endowment"},{"key":"420_CR16","doi-asserted-by":"crossref","DOI":"10.1145\/2882903.2882913","volume-title":"Truss decomposition of probabilistic graphs: Semantics and algorithms","author":"X Huang","year":"2016","unstructured":"Huang, X., Lu, W., Lakshmanan, L.V.: Truss decomposition of probabilistic graphs: Semantics and algorithms (2016)"},{"key":"420_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1391729.1391730","volume":"58","author":"IF Ilyas","year":"2008","unstructured":"Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. 58, 1\u201311 (2008)","journal-title":"ACM Comput. Surv."},{"key":"420_CR18","doi-asserted-by":"crossref","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. In: STOC, pp. 1\u201310 (1977)","DOI":"10.1145\/800105.803390"},{"key":"420_CR19","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, pp 589\u2013597 (2013)","DOI":"10.1145\/2487575.2487678"},{"key":"420_CR20","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: KDD, pp 137\u2013146 (2003)","DOI":"10.1145\/956755.956769"},{"issue":"1 - 3","key":"420_CR21","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. Theor. Comput. Sci. 407(1 - 3), 458\u2013473 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"420_CR22","doi-asserted-by":"crossref","unstructured":"Lin, X., Yuan, Y., Zhang, Q., stars, Y. Zhang. Selecting.: The k most representative skyline operator. In: ICDE, pp 86\u201395 (2007)","DOI":"10.1109\/ICDE.2007.367854"},{"key":"420_CR23","doi-asserted-by":"crossref","unstructured":"Lu, J., Senellart, P., Lin, C., Du, X., Wang, S., Chen, X.: Optimal top-k generation of attribute combinations based on ranked lists. In: SIGMOD, pp 409\u2013420 (2012)","DOI":"10.1145\/2213836.2213883"},{"key":"420_CR24","doi-asserted-by":"crossref","unstructured":"Luo, Y., Lin, X., Wang, W., Zhou, X.: Spark: Top-k keyword query in relational databases. In: SIGMOD, pp. 115\u2013126 (2007)","DOI":"10.1145\/1247480.1247495"},{"key":"420_CR25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816651","volume-title":"IEEE 30th International Conference on Data Engineering, Chicago, ICDE 2014, IL, USA, March 31 - April 4, 2014","author":"PW Olsen","year":"2014","unstructured":"Olsen, P.W., Labouseur, A.G., Hwang, J.-H: Efficient top-k closeness centrality search IEEE 30th International Conference on Data Engineering, Chicago, ICDE 2014, IL, USA, March 31 - April 4, 2014. (2014) doi: 10.1109\/ICDE.2014.6816651"},{"key":"420_CR26","unstructured":"Pfeiffer III, J.J., Neville, J.: Methods to determine node centrality and clustering in graphs with uncertain structure. arXiv preprint arXiv: 1104.0319 (2011)"},{"key":"420_CR27","doi-asserted-by":"crossref","unstructured":"Qin, L., Yu, J.X., Chang, L.: Diversifying top-k results. Proc. VLDB Endow. 1124\u20131135 (2012)","DOI":"10.14778\/2350229.2350233"},{"issue":"3","key":"420_CR28","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1016\/j.neuroimage.2009.10.003","volume":"52","author":"M Rubinov","year":"2010","unstructured":"Rubinov, M., Sporns, O.: Complex network measures of brain connectivity: Uses and interpretations. NeuroImage 52(3), 1059\u20131069 (2010)","journal-title":"NeuroImage"},{"key":"420_CR29","doi-asserted-by":"crossref","unstructured":"Soffer, S.N., V\u00e1zquez, A.: Network clustering coefficient without degree-correlation biases. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 71(5) (2005)","DOI":"10.1103\/PhysRevE.71.057101"},{"key":"420_CR30","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1038\/35065725","volume":"6825","author":"SH Strogatz","year":"2001","unstructured":"Strogatz, S.H.: Exploring complex networks. Nature 6825, 268\u2013276 (2001)","journal-title":"Nature"},{"key":"420_CR31","doi-asserted-by":"crossref","unstructured":"Suri, S., Vassilvitskii, S.: Counting triangles and the curse of the last reducer. In: WWW, pp. 607\u2013614 (2011)","DOI":"10.1145\/1963405.1963491"},{"key":"420_CR32","doi-asserted-by":"crossref","unstructured":"Tangwongsan, K., Pavan, A., Tirthapura, S.: Parallel triangle counting in massive streaming graphs. In: CIKM, pp. 781\u2013786 (2013)","DOI":"10.1145\/2505515.2505741"},{"key":"420_CR33","unstructured":"L.H.U., Mamoulis, N., Berberich, K., Bedathur, S.: Durable top-k search in document archives. In: SIGMOD, pp. 555\u2013566 (2010)"},{"key":"420_CR34","first-page":"87","volume-title":"A new method for identifying essential proteins based on edge clustering coefficient","author":"H Wang","year":"2011","unstructured":"Wang, H., Li, M., Wang, J., Pan, Y.: A new method for identifying essential proteins based on edge clustering coefficient, pp. 87\u201398 (2011)"},{"issue":"6684","key":"420_CR35","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 409\u201310 (1998)","journal-title":"Nature"},{"key":"420_CR36","doi-asserted-by":"crossref","unstructured":"Yan, X., He, B., Zhu, F., Han, J.: Top-k aggregation queries over large networks. In: ICDE (2010)","DOI":"10.1109\/ICDE.2010.5447863"},{"key":"420_CR37","doi-asserted-by":"crossref","unstructured":"Yu, A., Agarwal, P.K., Yang, J.: Processing a large number of continuous preference top-k queries. In: SIGMOD, pp. 397\u2013408 (2012)","DOI":"10.1145\/2213836.2213882"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-016-0420-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-016-0420-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-016-0420-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T08:47:08Z","timestamp":1568450828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-016-0420-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,11]]},"references-count":37,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["420"],"URL":"https:\/\/doi.org\/10.1007\/s11280-016-0420-2","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2016,10,11]]}}}