{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:04:43Z","timestamp":1725865483124},"publisher-location":"Cham","reference-count":4,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319458168"},{"type":"electronic","value":"9783319458175"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-45817-5_31","type":"book-chapter","created":{"date-parts":[[2016,9,17]],"date-time":"2016-09-17T12:16:04Z","timestamp":1474114564000},"page":"389-392","source":"Crossref","is-referenced-by-count":2,"title":["FVBM: A Filter-Verification-Based Method for Finding Top-k Closeness Centrality on Dynamic Social Networks"],"prefix":"10.1007","author":[{"given":"Yiyong","family":"Lin","sequence":"first","affiliation":[]},{"given":"Jinbo","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yuanxiang","family":"Ying","sequence":"additional","affiliation":[]},{"given":"Shenda","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Hongyan","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,18]]},"reference":[{"issue":"2","key":"31_CR1","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(2), 182\u2013209 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Olsen, P.W., Labouseur, A.G., Hwang, J.H.: Efficient top-k closeness centrality search. In: 2014 IEEE 30th International Conference on Data Engineering (ICDE), pp. 196\u2013207 (2014)","DOI":"10.1109\/ICDE.2014.6816651"},{"key":"31_CR3","unstructured":"Sariyuce, A.E., Kaya, K., Saule, E., Catalyurek, U.V.: Incremental algorithms for network management and analysis based on closeness centrality, arXiv preprint (2013). arXiv:1303.0422"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Yen, C.C., Yeh, M.Y., Chen, M.S.: An efficient approach to updating closeness centrality and average path length in dynamic networks. In: 2013 IEEE 13th International Conference on Data Mining (ICDM), pp. 867\u2013876. IEEE (2013)","DOI":"10.1109\/ICDM.2013.135"}],"container-title":["Lecture Notes in Computer Science","Web Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45817-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T19:03:14Z","timestamp":1498330994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45817-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458168","9783319458175"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45817-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}