TY - STD TI - 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. ACM. 2014, p. 1416–25. ID - ref1 ER - TY - JOUR AU - Freeman, L. C. PY - 1977 DA - 1977// TI - A set of measures of centrality based on betweenness JO - Sociometry VL - 40 UR - https://doi.org/10.2307/3033543 DO - 10.2307/3033543 ID - Freeman1977 ER - TY - STD TI - Jothi R. A betweenness centrality guided clustering algorithm and its applications to cancer diagnosis. In: International conference on mining intelligence and knowledge exploration. Springer. 2017, p. 35–42. ID - ref3 ER - TY - JOUR AU - Borgatti, S. P. PY - 2005 DA - 2005// TI - Centrality and network flow JO - Soci Netw VL - 27 UR - https://doi.org/10.1016/j.socnet.2004.11.008 DO - 10.1016/j.socnet.2004.11.008 ID - Borgatti2005 ER - TY - STD TI - Rusinowska A, Berghammer R, De Swart H, Grabisch M. Social networks: prestige, centrality, and influence. In: International conference on relational and algebraic methods in computer science. Springer. 2011, p. 22–39. ID - ref5 ER - TY - STD TI - Jin S, Huang Z, Chen Y, Chavarría-Miranda D, Feo J, Wong PC. A novel application of parallel betweenness centrality to power grid contingency analysis. In: 2010 IEEE international symposium on parallel & distributed processing (IPDPS). IEEE. 2010, p. 1–7. ID - ref6 ER - TY - JOUR AU - Girvan, M. AU - Newman, M. E. PY - 2002 DA - 2002// TI - Community structure in social and biological networks JO - Proc Natl Acad Sci VL - 99 UR - https://doi.org/10.1073/pnas.122653799 DO - 10.1073/pnas.122653799 ID - Girvan2002 ER - TY - JOUR AU - Yan, G. AU - Zhou, T. AU - Hu, B. AU - Fu, Z. Q. AU - Wang, B. H. PY - 2006 DA - 2006// TI - Efficient routing on complex networks JO - Phys Rev E VL - 73 UR - https://doi.org/10.1103/PhysRevE.73.046108 DO - 10.1103/PhysRevE.73.046108 ID - Yan2006 ER - TY - STD TI - Şimşek, Ö, Barto AG. Skill characterization based on betweenness. In: Advances in neural information processing systems. 2009, p. 1497–504. ID - ref9 ER - TY - STD TI - Carpenter T, Karakostas G, Shallcross D. Practical issues and algorithms for analyzing terrorist networks. In: Proceedings of the Western Simulation MultiConference. 2002. ID - ref10 ER - TY - STD TI - 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). 2016, p. 320–9. https://doi.org/10.1109/ICDM.2016.0043. ID - ref11 ER - TY - JOUR AU - Holme, P. AU - Kim, B. J. AU - Yoon, C. N. AU - Han, S. K. PY - 2002 DA - 2002// TI - Attack vulnerability of complex networks JO - Phy Rev E VL - 65 UR - https://doi.org/10.1103/PhysRevE.65.056109 DO - 10.1103/PhysRevE.65.056109 ID - Holme2002 ER - TY - JOUR AU - Brandes, U. PY - 2001 DA - 2001// TI - A faster algorithm for betweenness centrality JO - J Math Sociol VL - 25 UR - https://doi.org/10.1080/0022250X.2001.9990249 DO - 10.1080/0022250X.2001.9990249 ID - Brandes2001 ER - TY - STD TI - Bonchi F, De Francisci Morales 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, international World Wide Web Conferences Steering Committee. 2016, p. 1017–20. ID - ref14 ER - TY - STD TI - Chong WH, Toh WSB, Teow LN. Efficient extraction of high-betweenness vertices. In: 2010 international conference on advances in social networks analysis and mining (ASONAM). IEEE. 2010, p. 286–90. ID - ref15 ER - TY - STD TI - Ufimtsev V, Bhowmick S. Finding high betweenness centrality vertices in large networks. In: CSC14: The sixth SIAM workshop on combinatorial scientific computing. 2014, p. 45. ID - ref16 ER - TY - STD TI - AlGhamdi Z, Jamour F, Skiadopoulos S, Kalnis P. A benchmark for betweenness centrality approximation algorithms on large graphs. In: Proceedings of the 29th international conference on scientific and statistical database management. ACM. 2017, p. 6. ID - ref17 ER - TY - JOUR AU - Brandes, U. AU - Pich, C. PY - 2007 DA - 2007// TI - Centrality estimation in large networks JO - Int J Bifur Chaos VL - 17 UR - https://doi.org/10.1142/S0218127407018403 DO - 10.1142/S0218127407018403 ID - Brandes2007 ER - TY - JOUR AU - Bader, D. A. AU - Kintali, S. AU - Madduri, K. AU - Mihail, M. PY - 2007 DA - 2007// TI - Approximating betweenness centrality JO - WAW VL - 4863 ID - Bader2007 ER - TY - JOUR AU - Riondato, M. AU - Kornaropoulos, E. M. PY - 2016 DA - 2016// TI - Fast approximation of betweenness centrality through sampling JO - Data Mining Knowl Discov VL - 30 UR - https://doi.org/10.1007/s10618-015-0423-0 DO - 10.1007/s10618-015-0423-0 ID - Riondato2016 ER - TY - STD TI - Geisberger R, Sanders P, Schultes D. Better approximation of betweenness centrality. In: Proceedings of the meeting on algorithm engineering & expermiments. Society for Industrial and Applied Mathematics. 2008, p. 90–100. ID - ref21 ER - TY - STD TI - Riondato M, Upfal E. Abra: Approximating betweenness centrality in static and dynamic graphs with rademacher averages. arXiv preprint arXiv:1602.05866. 2016. UR - http://arxiv.org/abs/1602.05866 ID - ref22 ER - TY - STD TI - Pfeffer J, Carley KM. k-centralities: local approximations of global measures based on shortest paths. In: Proceedings of the 21st international conference on World Wide Web. ACM. 2012, p. 1043–50. ID - ref23 ER - TY - JOUR AU - Everett, M. AU - Borgatti, S. P. PY - 2005 DA - 2005// TI - Ego network betweenness JO - Soc Netw VL - 27 UR - https://doi.org/10.1016/j.socnet.2004.11.007 DO - 10.1016/j.socnet.2004.11.007 ID - Everett2005 ER - TY - STD TI - Matta J. A comparison of approaches to computing betweenness centrality for large graphs. In: International workshop on complex networks and their applications. Springer. 2017, p. 3–13. ID - ref25 ER - TY - JOUR AU - Brandes, U. PY - 2008 DA - 2008// TI - On variants of shortest-path betweenness centrality and their generic computation JO - Soci Netw VL - 30 UR - https://doi.org/10.1016/j.socnet.2007.11.001 DO - 10.1016/j.socnet.2007.11.001 ID - Brandes2008 ER - TY - STD TI - Eppstein D, Wang J. Fast approximation of centrality. In: Proceedings of the twelfth annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics. 2001, p. 228–9. ID - ref27 ER - TY - JOUR AU - Chehreghani, M. H. PY - 2014 DA - 2014// TI - An efficient algorithm for approximate betweenness centrality computation JO - Comput J VL - 57 UR - https://doi.org/10.1093/comjnl/bxu003 DO - 10.1093/comjnl/bxu003 ID - Chehreghani2014 ER - TY - BOOK AU - Bromberger, S. AU - Klymko, C. AU - Henderson, K. AU - Pearce, R. AU - Sanders, G. PY - 2017 DA - 2017// TI - Improving estimation of betweenness centrality for scale-free graphs PB - Lawrence Livermore National Lab CY - Livermore UR - https://doi.org/10.2172/1409962 DO - 10.2172/1409962 ID - Bromberger2017 ER - TY - STD TI - Borassi M, Natale E. Kadabra is an adaptive algorithm for betweenness via random approximation. arXiv preprint arXiv:1604.08553. 2016. UR - http://arxiv.org/abs/1604.08553 ID - ref30 ER - TY - STD TI - Mumtaz S, Wang X. Identifying top-k influential nodes in networks. In: Proceedings of the 2017 ACM on conference on information and knowledge management. ACM. 2017, p. 2219–22. ID - ref31 ER - TY - STD TI - Sariyüce AE, Saule E, Kaya K, Çatalyürek ÜV. Shattering and compressing networks for betweenness centrality. In: Proceedings of the 2013 SIAM international conference on data mining. SIAM. 2013, p. 686–94. ID - ref32 ER - TY - JOUR AU - Sariyüce, A. E. AU - Kaya, K. AU - Saule, E. AU - Çatalyürek, Ü. V. PY - 2017 DA - 2017// TI - Graph manipulations for fast centrality computation JO - ACM Trans Knowl Discov Data VL - 11 UR - https://doi.org/10.1145/3022668 DO - 10.1145/3022668 ID - Sariyüce2017 ER - TY - STD TI - Erdős D, Ishakian V, Bestavros A, Terzi E.: A divide-and-conquer algorithm for betweenness centrality. In: Proceedings of the 2015 SIAM international conference on data mining. SIAM. 2015, p. 433–41. ID - ref34 ER - TY - STD TI - Baglioni M, Geraci F, Pellegrini M, Lastres E. Fast exact computation of betweenness centrality in social networks. In: Proceedings of the 2012 international conference on advances in social networks analysis and mining (ASONAM 2012). IEEE Computer Society. 2012, p. 450–6. ID - ref35 ER - TY - JOUR AU - Li, Y. AU - Li, W. AU - Tan, Y. AU - Liu, F. AU - Cao, Y. AU - Lee, K. Y. PY - 2017 DA - 2017// TI - Hierarchical decomposition for betweenness centrality measure of complex networks JO - Sci Rep VL - 7 UR - https://doi.org/10.1038/srep46491 DO - 10.1038/srep46491 ID - Li2017 ER - TY - STD TI - Chehreghani MH, Bifet A, Abdessalem T. Efficient exact and approximate algorithms for computing betweenness centrality in directed graphs. arXiv preprint arXiv:1708.08739. 2017. UR - http://arxiv.org/abs/1708.08739 ID - ref37 ER - TY - STD TI - Sariyüce AE, Kaya K, Saule E, Çatalyürek ÜV. Betweenness centrality on gpus and heterogeneous architectures. In: Proceedings of the 6th workshop on general purpose processor using graphics processing units. ACM. 2013, p. 76–85. ID - ref38 ER - TY - STD TI - Wang W, Tang CY. Distributed estimation of betweenness centrality. In: 2015 53rd Annual allerton conference on communication, control, and computing (Allerton). IEEE. 2015, p. 250–7. ID - ref39 ER - TY - JOUR AU - Shi, Z. AU - Zhang, B. PY - 2011 DA - 2011// TI - Fast network centrality analysis using gpus JO - BMC Bioinf VL - 12 UR - https://doi.org/10.1186/1471-2105-12-149 DO - 10.1186/1471-2105-12-149 ID - Shi2011 ER - TY - STD TI - McLaughlin A, Bader DA. Scalable and high performance betweenness centrality on the gpu. In: Proceedings of the international conference for high performance computing, networking, storage and analysis. IEEE Press. 2014, p. 572–83. ID - ref41 ER - TY - STD TI - Bader, D.A., Madduri, K.: Parallel algorithms for evaluating centrality indices in real-world networks. In: International conference on parallel processing, 2006. ICPP 2006. IEEE. 2006, pp. 539–50. ID - ref42 ER - TY - STD TI - Pande P, Bader DA. Computing betweenness centrality for small world networks on a gpu. In: 15th Annual High performance embedded computing workshop (HPEC). 2011. ID - ref43 ER - TY - STD TI - Bernaschi M, Carbone G, Vella F. Scalable betweenness centrality on multi-gpu systems. In: Proceedings of the ACM international conference on computing frontiers. ACM. 2016, p. 29–36. ID - ref44 ER - TY - STD TI - Bernaschi M, Bisson M, Mastrostefano E, Vella F. Multilevel parallelism for the exploration of large-scale graphs. IEEE transactions on multi-scale computing systems. 2018. ID - ref45 ER - TY - STD TI - Ostrowski DA. An approximation of betweenness centrality for social networks. In: 2015 IEEE international conference on semantic computing (ICSC). IEEE. 2015, p. 489–92. ID - ref46 ER - TY - STD TI - Mahmoody A, Tsourakakis CE, Upfal E. Scalable betweenness centrality maximization via sampling. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. ACM. 2016, p. 1765–73. ID - ref47 ER - TY - JOUR AU - Bergamini, E. AU - Meyerhenke, H. PY - 2016 DA - 2016// TI - Approximating betweenness centrality in fully dynamic networks JO - Internet Math VL - 12 UR - https://doi.org/10.1080/15427951.2016.1177802 DO - 10.1080/15427951.2016.1177802 ID - Bergamini2016 ER - TY - JOUR AU - Lü, L. AU - Chen, D. AU - Ren, X. L. AU - Zhang, Q. M. AU - Zhang, Y. C. AU - Zhou, T. PY - 2016 DA - 2016// TI - Vital nodes identification in complex networks JO - Phys Rep VL - 650 UR - https://doi.org/10.1016/j.physrep.2016.06.007 DO - 10.1016/j.physrep.2016.06.007 ID - Lü2016 ER - TY - JOUR AU - Kourtellis, N. AU - Alahakoon, T. AU - Simha, R. AU - Iamnitchi, A. AU - Tripathi, R. PY - 2013 DA - 2013// TI - Identifying high betweenness centrality nodes in large social networks JO - Soc Netw Anal Mining VL - 3 UR - https://doi.org/10.1007/s13278-012-0076-6 DO - 10.1007/s13278-012-0076-6 ID - Kourtellis2013 ER - TY - JOUR AU - Dolev, S. AU - Elovici, Y. AU - Puzis, R. PY - 2010 DA - 2010// TI - Routing betweenness centrality JO - JACM VL - 57 UR - https://doi.org/10.1145/1734213.1734219 DO - 10.1145/1734213.1734219 ID - Dolev2010 ER - TY - BOOK AU - Hinne, M. PY - 2011 DA - 2011// TI - Local approximation of centrality measures PB - Radboud University Nijmegen CY - The Netherlands ID - Hinne2011 ER - TY - JOUR AU - Leskovec, J. AU - Sosič, R. PY - 2016 DA - 2016// TI - Snap: A general-purpose network analysis and graph-mining library JO - ACM Trans Intell Syst Technol VL - 8 UR - https://doi.org/10.1145/2898361 DO - 10.1145/2898361 ID - Leskovec2016 ER - TY - STD TI - 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. ID - ref54 ER - TY - JOUR AU - Barefoot, C. AU - Entringer, R. AU - Swart, H. PY - 1987 DA - 1987// TI - Vulnerability in graphs-a comparative survey JO - J Combinat Math Combinat Comput VL - 1 ID - Barefoot1987 ER - TY - JOUR AU - Liu, Y. Y. AU - Slotine, J. J. AU - Barabási, A. L. PY - 2011 DA - 2011// TI - Controllability of complex networks JO - Nature VL - 473 UR - https://doi.org/10.1038/nature10011 DO - 10.1038/nature10011 ID - Liu2011 ER - TY - STD TI - Moschoyiannis S, Elia N, Penn A, Lloyd D, Knight C. A web-based tool for identifying strategic intervention points in complex systems. CASSTING. 2016. ID - ref57 ER - TY - JOUR AU - Liu, Y. Y. AU - Slotine, J. J. AU - Barabási, A. L. PY - 2012 DA - 2012// TI - Control centrality and hierarchical structure in complex networks JO - PloS ONE VL - 7 UR - https://doi.org/10.1371/journal.pone.0044459 DO - 10.1371/journal.pone.0044459 ID - Liu2012 ER - TY - STD TI - Savvopoulos S, Moschoyiannis S. Impact of removing nodes on the controllability of complex networks. In: COMPLEX NETWORKS 2017: The 6th international conference on complex networks & their applications. 2017, p. 361–3. ID - ref59 ER - TY - JOUR AU - Matta, J. AU - Ercal, G. AU - Borwey, J. PY - 2017 DA - 2017// TI - The vertex attack tolerance of complex networks JO - RAIRO Oper Res. UR - https://doi.org/10.1051/ro/2017008 DO - 10.1051/ro/2017008 ID - Matta2017 ER - TY - JOUR AU - Ercal, G. u. n. e. s. AU - Matta, J. o. h. n. PY - 2013 DA - 2013// TI - Resilience Notions for Scale-free Networks JO - Procedia Computer Science VL - 20 UR - https://doi.org/10.1016/j.procs.2013.09.311 DO - 10.1016/j.procs.2013.09.311 ID - Ercal2013 ER - TY - STD TI - Ercal G. A note on the computational complexity of unsmoothened vertex attack tolerance. CoRR. 2016. http://arxiv.org/abs/1603.08430. UR - http://arxiv.org/abs/1603.08430 ID - ref62 ER - TY - STD TI - Cozzens M, Moazzami D, Stueckle S. The tenacity of a graph. In: Seventh international conference on the theory and applications of graphs. New York: Wiley; 1995. p. 1111–22. ID - ref63 ER - TY - STD TI - Mann DE. The tenacity of trees. Ph.D. thesis. Boston: Northeastern University; 1993. ID - ref64 ER - TY - JOUR AU - Chvatal, V. PY - 2006 DA - 2006// TI - Tough graphs and hamiltonian circuits JO - Discr Math. VL - 306 UR - https://doi.org/10.1016/j.disc.2006.03.011 DO - 10.1016/j.disc.2006.03.011 ID - Chvatal2006 ER - TY - JOUR AU - Broersma, H. AU - Fiala, J. AU - Golovach, P. A. AU - Kaiser, T. AU - Paulusma, D. AU - Proskurowski, A. PY - 2015 DA - 2015// TI - Linear-time algorithms for scattering number and hamilton-connectivity of interval graphs JO - J Graph Theory. VL - 79 UR - https://doi.org/10.1002/jgt.21832 DO - 10.1002/jgt.21832 ID - Broersma2015 ER - TY - CHAP AU - Milli, L. AU - Rossetti, G. AU - Pedreschi, D. AU - Giannotti, F. ED - Milli, L. ED - Rossetti, G. PY - 2017 DA - 2017// TI - Information diffusion in complex networks: the active/passive conundrum BT - International workshop on complex networks and their applications PB - Springer CY - Berlin ID - Milli2017 ER - TY - CHAP AU - Yu, H. AU - Chen, L. AU - Cao, X. AU - Liu, Z. AU - Li, Y. PY - 2017 DA - 2017// TI - Identifying top-k important nodes based on probabilistic-jumping random walk in complex networks BT - International workshop on complex networks and their applications PB - Springer CY - Berlin ID - Yu2017 ER - TY - CHAP AU - Joneydi, S. AU - Khansari, M. AU - Kaveh, A. PY - 2017 DA - 2017// TI - An opportunistic network approach towards disease spreading BT - International workshop on complex networks and their applications PB - Springer CY - Berlin ID - Joneydi2017 ER - TY - JOUR AU - Condon, A. AU - Karp, R. M. PY - 2001 DA - 2001// TI - Algorithms for graph partitioning on the planted partition model JO - Random Struct Algorith. VL - 18 UR - https://doi.org/3.0.CO;2-2 DO - 3.0.CO;2-2 ID - Condon2001 ER - TY - CHAP AU - Brandes, U. AU - Gaertler, M. AU - Wagner, D. PY - 2003 DA - 2003// TI - Experiments on graph clustering algorithms BT - European symposium on algorithms PB - Springer CY - Berlin ID - Brandes2003 ER - TY - JOUR AU - Lancichinetti, A. AU - Fortunato, S. AU - Radicchi, F. PY - 2008 DA - 2008// TI - Benchmark graphs for testing community detection algorithms JO - Phys Rev E VL - 78 UR - https://doi.org/10.1103/PhysRevE.78.046110 DO - 10.1103/PhysRevE.78.046110 ID - Lancichinetti2008 ER - TY - JOUR AU - Fortunato, S. PY - 2010 DA - 2010// TI - Community detection in graphs JO - Phys Rep. VL - 486 UR - https://doi.org/10.1016/j.physrep.2009.11.002 DO - 10.1016/j.physrep.2009.11.002 ID - Fortunato2010 ER - TY - JOUR AU - Staudt, C. L. AU - Sazonovs, A. AU - Meyerhenke, H. PY - 2016 DA - 2016// TI - Networkit: a tool suite for large-scale complex network analysis JO - Netw Sci VL - 4 UR - https://doi.org/10.1017/nws.2016.20 DO - 10.1017/nws.2016.20 ID - Staudt2016 ER -