{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:08:50Z","timestamp":1743044930879,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"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_1","type":"book-chapter","created":{"date-parts":[[2017,11,26]],"date-time":"2017-11-26T08:21:29Z","timestamp":1511684489000},"page":"3-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Comparison of Approaches to Computing Betweenness Centrality for Large Graphs"],"prefix":"10.1007","author":[{"given":"John","family":"Matta","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,27]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.patcog.2012.07.021","volume":"46","author":"O Arbelaitz","year":"2013","unstructured":"Arbelaitz, O., Gurrutxaga, I., Muguerza, J., P\u00e9Rez, J.M., Perona, I.N.: An extensive comparative study of cluster validity indices. Pattern Recogn. 46(1), 243\u2013256 (2013)","journal-title":"Pattern Recogn."},{"key":"1_CR2","first-page":"12","volume":"1","author":"C Barefoot","year":"1987","unstructured":"Barefoot, C., Entringer, R., Swart, H.: Vulnerability in graphs-a comparative survey. J. Comb. Math. Comb. Comput. 1, 12\u201322 (1987)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), P10008 (2008)","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bonchi, F., De\u00a0Francisci\u00a0Morales, G., Riondato, M.: Centrality measures on big graphs: exact, approximated, and distributed algorithms. In: Proceedings of the 25th International Conference Companion on World Wide Web, pp. 1017\u20131020. International World Wide Web Conferences Steering Committee (2016)","DOI":"10.1145\/2872518.2891063"},{"key":"1_CR5","unstructured":"Borwey, J., Ahlert, D., Obafemi-Ajayi, T., Ercal, G.: A graph-theoretic clustering methodology based on vertex-attack tolerance. In: The Twenty-Eighth International Flairs Conference (2015)"},{"key":"1_CR6","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. Sociol. 25, 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"key":"1_CR7","unstructured":"Carpenter, T., Karakostas, G., Shallcross, D.: Practical issues and algorithms for analyzing terrorist networks. In: Proceedings of the Western Simulation MultiConference (2002)"},{"issue":"4","key":"1_CR8","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1016\/j.physa.2011.09.017","volume":"391","author":"D Chen","year":"2012","unstructured":"Chen, D., L\u00fc, L., Shang, M.S., Zhang, Y.C., Zhou, T.: Identifying influential nodes in complex networks. Phys. A Stat. Mech. Appl. 391(4), 1777\u20131787 (2012)","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Chong, W.H., Toh, W.S.B., Teow, L.N.: Efficient extraction of high-betweenness vertices. In: 2010 International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 286\u2013290. IEEE (2010)","DOI":"10.1109\/ASONAM.2010.31"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Drange, P.G., Dregi, M.S., vant Hof, P.: On the computational complexity of vertex integrity and component order connectivity. In: Algorithms and Computation, pp. 285\u2013297. Springer International Publishing (2014)","DOI":"10.1007\/978-3-319-13075-0_23"},{"key":"1_CR11","unstructured":"Ercal, G.: A note on the computational complexity of unsmoothened vertex attack tolerance. CoRR abs\/1603.08430 (2016). http:\/\/arxiv.org\/abs\/1603.08430"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Ercal, G., Matta, J.: Resilience notions for scale-free networks. In: Complex Adaptive Systems, pp. 510\u2013515 (2013)","DOI":"10.1016\/j.procs.2013.09.311"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry, 35\u201341 (1977)","DOI":"10.2307\/3033543"},{"issue":"12","key":"1_CR14","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Holme, P., Kim, B.J., Yoon, C.N., Han, S.K.: Attack vulnerability of complex networks. Phys. Rev. E 65(5), 056109 (2002)","DOI":"10.1103\/PhysRevE.65.056109"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4), 046110 (2008)","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Matta, J., Obafemi-Ajayi, T., Borwey, J., Wunsch, D., Ercal, G.: Robust graph-theoretic clustering approaches using node-based resilience measures. In: 2016 IEEE 16th International Conference on Data Mining (ICDM), pp. 320\u2013329 (2016). https:\/\/doi.org\/10.1109\/ICDM.2016.0043","DOI":"10.1109\/ICDM.2016.0043"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Matta, J., Ercal, G., Borwey, J.: The vertex attack tolerance of complex networks. RAIRO-Oper. Res. (2017). https:\/\/doi.org\/10.1051\/ro\/2017008","DOI":"10.1051\/ro\/2017008"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"McLaughlin, A., Bader, D.A.: Scalable and high performance betweenness centrality on the gpu. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 572\u2013583. IEEE Press (2014)","DOI":"10.1109\/SC.2014.52"},{"issue":"3","key":"1_CR20","first-page":"26","volume":"11","author":"AE Sariy\u00fcce","year":"2017","unstructured":"Sariy\u00fcce, A.E., Kaya, K., Saule, E., \u00c7ataly\u00fcrek, \u00dc.V.: Graph manipulations for fast centrality computation. ACM Trans. Knowl. Discov. Data (TKDD) 11(3), 26 (2017)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"1_CR21","unstructured":"\u015eim\u015fek, \u00d6., Barto, A.G.: Skill characterization based on betweenness. In: Advances in Neural Information Processing Systems, pp. 1497\u20131504 (2009)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Ufimtsev, V., Bhowmick, S.: Finding high betweenness centrality vertices in large networks. In: CSC14: The Sixth SIAM Workshop on Combinatorial Scientific Computing, p.\u00a045 (2014)","DOI":"10.1109\/IPDPSW.2013.171"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Yan, G., Zhou, T., Hu, B., Fu, Z.Q., Wang, B.H.: Efficient routing on complex networks. Phys. Rev. E 73(4), 046108 (2006)","DOI":"10.1103\/PhysRevE.73.046108"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Yoshida, Y.: Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1416\u20131425. ACM (2014)","DOI":"10.1145\/2623330.2623626"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T17:00:07Z","timestamp":1570381207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72150-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,27]]},"ISBN":["9783319721491","9783319721507"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72150-7_1","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]]}}}