The week's pick
Random Articles
Reseach Article
Finding Strongly Connected Components in a Social Network Graph
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 136 - Number 7 |
| Year of Publication: 2016 |
| Authors: Swati Dhingra, Poorvi S. Dodwad, Meghna Madan |
10.5120/ijca2016908481
|
Swati Dhingra, Poorvi S. Dodwad, Meghna Madan . Finding Strongly Connected Components in a Social Network Graph. International Journal of Computer Applications. 136, 7 ( February 2016), 1-5. DOI=10.5120/ijca2016908481
Abstract
A strongly connected component (SCC) of a digraph is a maximal set of vertices such that every vertex is reachable from every other vertex. This topic is very interesting because of the way the algorithm can be used in various applications of network and communications. The Strongly Connected Components Detection (SCCD) algorithm can be a powerful tool in social networking service that is a platform to construct social networks or social relations forming communities, among people who offer similar interests, activities, establishments or genuine associations. SNS can study the evolution of those communities and getting to know what community a person belongs to, may help him, getting better ads targeting their essentials. In this work, we propose to apply SCC Detection algorithm to the Social Network Graph (or SNG) to identify smaller groups of nodes related to each other by some specific criteria (Sports, Health, Technology, Religion, etc). We discuss some findings observed from the application of this algorithm to the SNG.
References
- Boyd, danah; Ellison, Nicole (2008). "Social Network Sites: Definition, History, and Scholarship". Journal of Computer-Mediated Communication 13: 210–230.doi:10.1111/j.1083-6101.2007.00393.x.
- Jiri Barnat, Petr Bauch, Lubos Brim, and Milan Ceska, Computing Strongly connected components in parallel onCUDA, IEEE 2011 International Parallel & DistributedProcessing Symposium
- Kurt Mehlhorn, Stefan Naher and Peter Sanders, Engineering DFS based Graph Algorithms, Partially supported by DFG grant SA 933/3-1, 2007
- H.N. Gabow. Path-based depth first search strong and biconnected components, Information Processing Letters, 74(3-4):107-114, 2000
- Marije de Heus, Towards a Library of Parallel Graph Algorithm in Java, 14th Twenty Student conference on IT January 21st 2011
- Robert Sedgewick, Kevin Wayne, The Text Book Algorithm 4th Edition http://algs4.cs.princeton.edu/home/ retrieved on 10-2015
- Twitter MAU Were 302M For Q1, Up 18% YoY - Twitter (NYSE:TWTR) | Benzinga]. April 28, 2015 retrieved on October 17, 2015.
- David Easley and Jon Kleinberg, Reasoning about a highly
- connected world, Textbook, Cambridge University Press, 2010
- Mark C. Chu-carroll, The website Science blog http://scienceblogs.com/goodmath/2007/10/computing_strongly_connected_c.php retrieved on 10-2015
- Notes on Strongly Connected Components retrieved on October 10, 2015.
- Saleh Alshomrani , Gulraiz Iqbal, Analysis of Strongly Connected Components (SCC) Using Dynamic Graph Representation, IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 4, No 1, July 2012.
- https://en.wikipedia.org/wiki/Kosaraju%27s_algorithm retrieved on December 20, 2015.
- https://en.wikipedia.org/wiki/Twitter retrieved on December 20, 2015.
Index Terms
Keywords