{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:22:05Z","timestamp":1743027725121,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319721491"},{"type":"electronic","value":"9783319721507"}],"license":[{"start":{"date-parts":[[2017,11,27]],"date-time":"2017-11-27T00:00:00Z","timestamp":1511740800000},"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-72150-7_28","type":"book-chapter","created":{"date-parts":[[2017,11,26]],"date-time":"2017-11-26T08:21:29Z","timestamp":1511684489000},"page":"341-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Incremental Laplace Centrality Algorithm for Dynamic Networks"],"prefix":"10.1007","author":[{"given":"Rui Portocarrero","family":"Sarmento","sequence":"first","affiliation":[]},{"given":"M\u00e1rio","family":"Cordeiro","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Brazdil","sequence":"additional","affiliation":[]},{"given":"Jo\u00e3o","family":"Gama","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,27]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Soc. 25, 163\u2013177 (2001)","journal-title":"J. Math. Soc."},{"key":"28_CR2","doi-asserted-by":"publisher","unstructured":"Floyd, R.W.: Algorithm 97: Shortest path. Commun. ACM 5(6), 345\u2013 (1962). https:\/\/doi.org\/10.1145\/367766.368168","DOI":"10.1145\/367766.368168"},{"key":"28_CR3","doi-asserted-by":"publisher","unstructured":"Kas, M., Carley, K.M., Carley, L.R.: Incremental closeness centrality for dynamically changing social networks. In: Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM\u201913, pp. 1250\u20131258. ACM, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2492517.2500270","DOI":"10.1145\/2492517.2500270"},{"key":"28_CR4","doi-asserted-by":"publisher","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining-KDD\u201905, p. 177. ACM Press, New York, New York, USA (2005). https:\/\/doi.org\/10.1145\/1081870.1081893","DOI":"10.1145\/1081870.1081893"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Nasre, M., Pontecorvi, M., Ramachandran, V.: Betweenness centrality-incremental and faster. CoRR arXiv:1311.2147 (2013)","DOI":"10.1007\/978-3-662-44465-8_49"},{"issue":"01","key":"28_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.4236\/sn.2013.21003","volume":"02","author":"X Qi","year":"2013","unstructured":"Qi, X., Duval, R.D., Christensen, K., Fuller, E., Spahiu, A., Wu, Q., Wu, Y., Tang, W., Zhang, C.: Terrorist networks, network energy and node removal: a new measure of centrality based on laplacian energy. Soc. Netw. 02(01), 19\u201331 (2013). https:\/\/doi.org\/10.4236\/sn.2013.21003","journal-title":"Soc. Netw."},{"key":"28_CR7","doi-asserted-by":"publisher","unstructured":"Qi, X., Fuller, E., Wu, Q., Wu, Y., Zhang, C.Q.: Laplacian centrality: A new centrality measure for weighted networks. Inf. Sci. 194, 240\u2013253 (2012). https:\/\/doi.org\/10.1016\/j.ins.2011.12.027","DOI":"10.1016\/j.ins.2011.12.027"},{"key":"28_CR8","doi-asserted-by":"publisher","unstructured":"Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms 21(2), 267\u2013305 (1996). https:\/\/doi.org\/10.1006\/jagm.1996.0046","DOI":"10.1006\/jagm.1996.0046"},{"key":"28_CR9","unstructured":"igraph\u00a0core team, T.: igraph-python recipes. http:\/\/igraph.wikidot.com\/python-recipes#toc4 (2014). Accessed July 2017"},{"key":"28_CR10","unstructured":"Wheeler, A.P.: Laplacian centrality in networkx (python). https:\/\/andrewpwheeler.wordpress.com\/2015\/07\/29\/laplacian-centrality-in-networkx-python\/ (2015). Accessed Apr 2017"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72150-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T17:00:38Z","timestamp":1570381238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72150-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,27]]},"ISBN":["9783319721491","9783319721507"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72150-7_28","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2017,11,27]]}}}