{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:31:24Z","timestamp":1742913084499,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_49","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:33:02Z","timestamp":1407839582000},"page":"577-588","source":"Crossref","is-referenced-by-count":27,"title":["Betweenness Centrality \u2013 Incremental and Faster"],"prefix":"10.1007","author":[{"given":"Meghana","family":"Nasre","sequence":"first","affiliation":[]},{"given":"Matteo","family":"Pontecorvi","sequence":"additional","affiliation":[]},{"given":"Vijaya","family":"Ramachandran","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"49_CR1","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1137\/S0097539703428324","volume":"36","author":"L. Arge","year":"2007","unstructured":"Arge, L., Bender, M.A., Demaine, E.D., Holland-Minkley, B., Munro, J.I.: An optimal cache-oblivious priority queue and its application to graph algorithms. SIAM J. Comput.\u00a036(6), 1672\u20131695 (2007)","journal-title":"SIAM J. Comput."},{"key":"49_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-77004-6_10","volume-title":"Algorithms and Models for the Web-Graph","author":"D.A. Bader","year":"2007","unstructured":"Bader, D.A., Kintali, S., Madduri, K., Mihail, M.: Approximating betweenness centrality. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol.\u00a04863, pp. 124\u2013137. Springer, Heidelberg (2007)"},{"issue":"2","key":"49_CR3","doi-asserted-by":"publisher","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. of Mathematical Sociology\u00a025(2), 163\u2013177 (2001)","journal-title":"J. of Mathematical Sociology"},{"issue":"1","key":"49_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s13278-012-0060-1","volume":"3","author":"S. Catanese","year":"2013","unstructured":"Catanese, S., Ferrara, E., Fiumara, G.: Forensic analysis of phone call networks. Social Network Analysis and Mining\u00a03(1), 15\u201333 (2013)","journal-title":"Social Network Analysis and Mining"},{"issue":"6","key":"49_CR5","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1145\/1039488.1039492","volume":"51","author":"C. Demetrescu","year":"2004","unstructured":"Demetrescu, C., Italiano, G.F.: A new approach to dynamic all pairs shortest paths. J. ACM\u00a051(6), 968\u2013992 (2004)","journal-title":"J. ACM"},{"issue":"1","key":"49_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L.C. Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry\u00a040(1), 35\u201341 (1977)","journal-title":"Sociometry"},{"issue":"1","key":"49_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(85)90059-9","volume":"10","author":"A. Frieze","year":"1985","unstructured":"Frieze, A., Grimmett, G.: The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics\u00a010(1), 57\u201377 (1985)","journal-title":"Discrete Applied Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D.: Better approximation of betweenness centrality. In: Proc. ALENEX, pp. 90\u2013100 (2008)","key":"49_CR8","DOI":"10.1137\/1.9781611972887.9"},{"issue":"12","key":"49_CR9","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. the National Academy of Sciences\u00a099(12), 7821\u20137826 (2002)","journal-title":"Proc. the National Academy of Sciences"},{"key":"49_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-03536-9_14","volume-title":"Algorithms and Models for the Web Graph","author":"K. Goel","year":"2013","unstructured":"Goel, K., Singh, R.R., Iyengar, S., Sukrit: A faster algorithm to update betweenness centrality after node alteration. In: Bonato, A., Mitzenmacher, M., Pra\u0142at, P. (eds.) WAW 2013. LNCS, vol.\u00a08305, pp. 170\u2013184. Springer, Heidelberg (2013)"},{"key":"49_CR11","doi-asserted-by":"publisher","first-page":"17101","DOI":"10.1103\/PhysRevE.67.017101","volume":"67","author":"K.-I. Goh","year":"2003","unstructured":"Goh, K.-I., Oh, E., Kahng, B., Kim, D.: Betweenness centrality correlation in social networks. Phys. Rev. E\u00a067, 017101 (2003)","journal-title":"Phys. Rev. E"},{"doi-asserted-by":"crossref","unstructured":"Green, O., McColl, R., Bader, D.A.: A fast algorithm for streaming betweenness centrality. In: Proc. PASSAT, pp. 11\u201320 (2012)","key":"49_CR12","DOI":"10.1109\/SocialCom-PASSAT.2012.37"},{"issue":"4","key":"49_CR13","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1287\/moor.10.4.557","volume":"10","author":"R. Hassin","year":"1985","unstructured":"Hassin, R., Zemel, E.: On shortest paths in graphs with random weights. Mathematics of Operations Research\u00a010(4), 557\u2013564 (1985)","journal-title":"Mathematics of Operations Research"},{"key":"49_CR14","doi-asserted-by":"publisher","first-page":"56109","DOI":"10.1103\/PhysRevE.65.056109","volume":"65","author":"P. Holme","year":"2002","unstructured":"Holme, P., Kim, B.J., Yoon, C.N., Han, S.K.: Attack vulnerability of complex networks. Phys. Rev. E\u00a065, 056109 (2002)","journal-title":"Phys. Rev. E"},{"issue":"6","key":"49_CR15","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1137\/0222071","volume":"22","author":"D.R. Karger","year":"1993","unstructured":"Karger, D.R., Koller, D., Phillips, S.J.: Finding the hidden path: Time bounds for all-pairs shortest paths. SIAM J. Comput.\u00a022(6), 1199\u20131217 (1993)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Kas, M., Wachs, M., Carley, K.M., Carley, L.R.: Incremental algorithm for updating betweenness centrality in dynamically growing networks. In: Proc. ASONAM, pp. 33\u201340. ACM (2013)","key":"49_CR16","DOI":"10.1145\/2492517.2492533"},{"key":"49_CR17","doi-asserted-by":"publisher","first-page":"56115","DOI":"10.1103\/PhysRevE.75.056115","volume":"75","author":"M. Kitsak","year":"2007","unstructured":"Kitsak, M., Havlin, S., Paul, G., Riccaboni, M., Pammolli, F., Stanley, H.E.: Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks. Phys. Rev. E\u00a075, 056115 (2007)","journal-title":"Phys. Rev. E"},{"doi-asserted-by":"crossref","unstructured":"Kourtellis, N., Iamnitchi, A.: Leveraging peer centrality in the design of socially-informed peer-to-peer systems. CoRR, abs\/1210.6052 (2012)","key":"49_CR18","DOI":"10.1109\/P2P.2011.6038751"},{"unstructured":"Kourtellis, N., Morales, G.D.F., Bonchi, F.: Scalable online betweenness centrality in evolving graphs. CoRR, abs\/1401.6981 (2014)","key":"49_CR19"},{"issue":"3","key":"49_CR20","first-page":"43","volume":"24","author":"V. Krebs","year":"2002","unstructured":"Krebs, V.: Mapping networks of terrorist cells. Connections\u00a024(3), 43\u201352 (2002)","journal-title":"Connections"},{"doi-asserted-by":"crossref","unstructured":"Lee, M.-J., Lee, J., Park, J.Y., Choi, R.H., Chung, C.-W.: Qube: a quick algorithm for updating betweenness centrality. In: Proc. WWW, pp. 351\u2013360 (2012)","key":"49_CR21","DOI":"10.1145\/2187836.2187884"},{"issue":"9","key":"49_CR22","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1002\/asi.20614","volume":"58","author":"L. Leydesdorff","year":"2007","unstructured":"Leydesdorff, L.: Betweenness centrality as an indicator of the interdisciplinarity of scientific journals. J. Am. Soc. Inf. Sci. Technol.\u00a058(9), 1303\u20131319 (2007)","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"issue":"1-4","key":"49_CR23","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/BF01553908","volume":"4","author":"M. Luby","year":"1989","unstructured":"Luby, M., Ragde, P.: A bidirectional shortest-path algorithm with good average-case behavior. Algorithmica\u00a04(1-4), 551\u2013567 (1989)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Madduri, K., Ediger, D., Jiang, K., Bader, D.A., Chavarr\u00eda-Miranda, D.G.: A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets. In: Proc. IPDPS, pp. 1\u20138 (2009)","key":"49_CR24","DOI":"10.2172\/951102"},{"issue":"2","key":"49_CR25","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s13278-011-0029-5","volume":"2","author":"L. Maglaras","year":"2012","unstructured":"Maglaras, L., Katsaros, D.: New measures for characterizing the significance of nodes in wireless ad hoc networks via localized path-based neighborhood analysis. Social Network Analysis and Mining\u00a02(2), 97\u2013106 (2012)","journal-title":"Social Network Analysis and Mining"},{"issue":"5","key":"49_CR26","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/BF01190847","volume":"13","author":"C.C. McGeoch","year":"1995","unstructured":"McGeoch, C.C.: All-pairs shortest paths and the essential subgraph. Algorithmica\u00a013(5), 426\u2013441 (1995)","journal-title":"Algorithmica"},{"key":"49_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/3-540-45749-6_63","volume-title":"Algorithms - ESA 2002","author":"K. Mehlhorn","year":"2002","unstructured":"Mehlhorn, K., Meyer, U.: External-memory breadth-first search with sublinear I\/O. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 723\u2013735. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"Nasre, M., Pontecorvi, M., Ramachandran, V.: Decremental and fully dynamic all pairs all shortest paths and betweenness centrality. Manuscript (2014)","key":"49_CR28","DOI":"10.1007\/978-3-319-13075-0_60"},{"issue":"1","key":"49_CR29","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(03)00402-X","volume":"312","author":"S. Pettie","year":"2004","unstructured":"Pettie, S.: A new approach to all-pairs shortest paths on real-weighted graphs. Theoretical Computer Science\u00a0312(1), 47\u201374 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"49_CR30","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1137\/S0097539702419650","volume":"34","author":"S. Pettie","year":"2005","unstructured":"Pettie, S., Ramachandran, V.: A shortest path algorithm for real-weighted undirected graphs. SIAM J. Comput.\u00a034(6), 1398\u20131431 (2005)","journal-title":"SIAM J. Comput."},{"unstructured":"Pinney, J.W., McConkey, G.A., Westhead, D.R.: Decomposition of biological networks using betweenness centrality. In: Proc. RECOMB. Poster session (2005)","key":"49_CR31"},{"issue":"1","key":"49_CR32","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/15472450.2012.716663","volume":"17","author":"R. Puzis","year":"2013","unstructured":"Puzis, R., Altshuler, Y., Elovici, Y., Bekhor, S., Shiftan, Y., Pentland, A.S.: Augmented betweenness centrality for environmentally aware traffic monitoring in transportation networks. J. of Intell. Transpor. Syst.\u00a017(1), 91\u2013105 (2013)","journal-title":"J. of Intell. Transpor. Syst."},{"doi-asserted-by":"crossref","unstructured":"Ram\u00edrez: The social networks of academic performance in a student context of poverty in Mexico. Social Networks\u00a026(2), 175\u2013188 (2004)","key":"49_CR33","DOI":"10.1016\/j.socnet.2004.01.010"},{"key":"49_CR34","doi-asserted-by":"publisher","first-page":"55103","DOI":"10.1103\/PhysRevE.71.055103","volume":"71","author":"B.K. Singh","year":"2005","unstructured":"Singh, B.K., Gupte, N.: Congestion and decongestion in a communication network. Phys. Rev. E\u00a071, 055103 (2005)","journal-title":"Phys. Rev. E"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T09:50:36Z","timestamp":1676886636000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}