Performance analysis of an algorithm for computation of betweenness centrality

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6786 LNCS, Issue PART 5, 2011, Pages 537-546

  Bhardwaj, Shivam ^a   Niyogi, Rajdeep ^a   Milani, Alfredo ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY ROORKEE   (India)

^b UNIVERSITY OF PERUGIA   (Italy)

Author keywords

betweenness centrality; Social networks

Indexed keywords

BETWEENNESS CENTRALITY; CENTRALITY MEASURES; EFFICIENT ALGORITHM; GRAPH-THEORETIC; PERFORMANCE ANALYSIS; PERFORMANCE IMPROVEMENTS; SCALABLE ALGORITHMS; SOCIAL NETWORK ANALYSIS; SOCIAL NETWORKS; SPACE COMPLEXITY; TIME COMPLEXITY;

ALGORITHMS; ELECTRIC NETWORK ANALYSIS; GRAPH THEORY; PARALLEL ARCHITECTURES; SOCIAL NETWORKING (ONLINE);

COMPUTATIONAL EFFICIENCY;

EID: 79960287101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21934-4_44     Document Type: Conference Paper

References (16)

1. HitWise Press Release (2006), http://www.hitwise.com/press-center/ hitwiseHS2004/social-networking-june-2006.php
2. Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)
3. Freeman, L.C.: Centrality in social networks: Conceptual clarification. Social Networks 1, 215-239 (1979)
4. Li, L., Alderson, D., Doyle, J.C., Willinger, W.: Towards a Theory of Scale-Free Graphs: Definitions, Properties, and Implications. Internet Mathematics 2(4), 431-523 (2006)
5. Everett, M.G., Borgatti, S.P.: Krackhardt. D.: Ego-network betweenness. Paper presented at the 19th International Conference on Social Network Analysis (Sunbelt XIX), Charleston, South Carolina (1999)
6. Ellis, A.R.: Using SAS to Calculate Betweenness Centrality, Connections: International network For Social Network Analysis, vol. 29, pp. 26-32 (2009)
7. Brandes, U.: A Faster Algorithm for Betweenness Centrality. Journal of Mathematical Sociology 25(2), 163-177 (2001)
8. Nichols, B.: Pthreads Programming: a Posix Standard for Better Multiprocessing. Ignatius Press, San Francisco (1996)
9. Vetter, S., Aoyama, Y., Nakano, J.: Practical MPI Programming. IBM Redbooks publication (1999)
10. Kintali, S.: Betweenness Centrality: Algorithms and lower bounds, arXiv.org〉cs〉arXiv:0809.1906 (2008)
11. Bader, D.A., Kintali, S., Madduri, K., Mihail, M.: Approximating betweenness centrality. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 124-137. Springer, Heidelberg (2007)
12. Griesberger, R., Sanders, P., Schultes, D.: Better approximation of betweenness centrality. In: Workshop of algorithm engineering and experiments (January 2008)
13. Bader, D.A., Madduri, K.: Parallel algorithms for evaluating centrality indices in real-world networks. In: Proc. 35th Int'l. Conf. on Parallel Processing (ICPP 2006), Columbus, Ohio, pp. 539-550. IEEE Computer Society, Los Alamitos (2006)
14. Madduri, K., Ediger, D., Jiang, K., Bader, D.A., Chavarria-Miranda, D.: A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets. In: Proc. 3rd Workshop on Multithreaded Architectures and Applications (MTAAP 2009), Rome, Italy, May 2009, IEEE Computer Society, Los Alamitos (2009)
15. Tan, G., Tu, D., Sun, N.: A parallel algorithm for computing betweenness centrality. In: Intl. Conference on Parallel Processing, IEEE Xplore (2009)
16. Tu, D., Tan, G.: Characterizing betweenness centrality algorithm on multicore architectures. In: IEEE Intl. Symposium on Parallel and Distributed Processing with Applications (ISPA), Chengdu, China (August 2009)