{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T09:53:42Z","timestamp":1763978022024,"version":"3.37.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319780238"},{"type":"electronic","value":"9783319780245"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78024-5_26","type":"book-chapter","created":{"date-parts":[[2018,3,22]],"date-time":"2018-03-22T12:28:25Z","timestamp":1521721705000},"page":"290-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Approximating Personalized Katz Centrality in Dynamic Graphs"],"prefix":"10.1007","author":[{"given":"Eisha","family":"Nathan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David A.","family":"Bader","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,23]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199211517.001.0001","volume-title":"Scale-Free Networks: Complex Webs in Nature and Technology","author":"G Caldarelli","year":"2007","unstructured":"Caldarelli, G.: Scale-Free Networks: Complex Webs in Nature and Technology. Oxford University Press, Oxford (2007)"},{"issue":"4","key":"26_CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","volume":"424","author":"S Boccaletti","year":"2006","unstructured":"Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.-U.: Complex networks: structure and dynamics. Phys. Rep. 424(4), 175\u2013308 (2006)","journal-title":"Phys. Rep."},{"issue":"1","key":"26_CR3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39\u201343 (1953)","journal-title":"Psychometrika"},{"issue":"1","key":"26_CR4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35\u201341 (1977)","journal-title":"Sociometry"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Green, O., McColl, R., Bader, D.A.: A fast algorithm for streaming betweenness centrality. In: 2012 International Conference on and 2012 International Conference on Social Computing (SocialCom), Privacy, Security, Risk and Trust (PASSAT), pp. 11\u201320. IEEE (2012)","DOI":"10.1109\/SocialCom-PASSAT.2012.37"},{"key":"26_CR6","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web (1999)"},{"issue":"3","key":"26_CR7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.14778\/1929861.1929864","volume":"4","author":"B Bahmani","year":"2010","unstructured":"Bahmani, B., Chowdhury, A., Goel, A.: Fast incremental and personalized pagerank. Proc. VLDB Endow. 4(3), 173\u2013184 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Langville, A.N., Meyer, C.D.: Updating pagerank with iterative aggregation. In: Proceedings of the 13th International World Wide Web Conference on Alternate Track Papers and Posters, pp. 392\u2013393. ACM (2004)","DOI":"10.1145\/1013367.1013491"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Riedy, J.: Updating pagerank for streaming graphs. In: 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, pp. 877\u2013884. IEEE (2016)","DOI":"10.1109\/IPDPSW.2016.22"},{"issue":"4","key":"26_CR10","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1023\/A:1013470632383","volume":"7","author":"KC Foster","year":"2001","unstructured":"Foster, K.C., Muth, S.Q., Potterat, J.J., Rothenberg, R.B.: A faster katz status score algorithm. Comput. Math. Organ. Theory 7(4), 275\u2013285 (2001)","journal-title":"Comput. Math. Organ. Theory"},{"issue":"7","key":"26_CR11","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Assoc. Inf. Sci. Technol. 58(7), 1019\u20131031 (2007)","journal-title":"J. Assoc. Inf. Sci. Technol."},{"key":"26_CR12","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"M Newman","year":"2010","unstructured":"Newman, M.: Networks: An Introduction. Oxford University Press, Oxford (2010)"},{"issue":"2","key":"26_CR13","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1093\/comnet\/cnt007","volume":"1","author":"M Benzi","year":"2013","unstructured":"Benzi, M., Klymko, C.: Total communicability as a centrality measure. J. Complex Netw. 1(2), 124\u2013149 (2013)","journal-title":"J. Complex Netw."},{"key":"26_CR14","unstructured":"Benzi, M., Klymko, C.: A matrix analysis of different centrality measures. arXiv preprint arXiv:1312.6722 (2014)"},{"key":"26_CR15","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems. SIAM, Philadelphia (2003)"},{"key":"26_CR16","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs, i. Publicationes Mathematicae (Debrecen) 6, 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae (Debrecen)"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-mat: a recursive model for graph mining. In: SDM, vol. 4, pp. 442\u2013446. SIAM (2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: KONECT: the koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1343\u20131350. ACM (2013)","DOI":"10.1145\/2487788.2488173"},{"issue":"6749","key":"26_CR19","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R Albert","year":"1999","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.-L.: Internet: diameter of the world-wide web. Nature 401(6749), 130\u2013131 (1999)","journal-title":"Nature"},{"key":"26_CR20","unstructured":"Hawick, K., James, H.: Node importance ranking and scaling properties of some complex road networks (2007)"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78024-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T18:50:28Z","timestamp":1693594228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-78024-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319780238","9783319780245"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78024-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}