%0 Journal Article
%T A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
%J International Journal of Nonlinear Analysis and Applications
%I Semnan University
%Z 2008-6822
%A Kashani, M.
%A Shojaedini, S.V.
%A Gorgin, S.
%D 2019
%\ 11/01/2019
%V 10
%N 1
%P 185-192
%! A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
%K Social networks
%K Graph coloring
%K Cellular automata
%R 10.22075/ijnaa.2019.4063
%X All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch withthem. In this study, the main goal is introducing a new approach for detecting these groups andminimizing the number of these groups using a cellular automat algorithm. There are two types ofsocial networks, containing simulated social network and real social network. The results show thatthe introduced method has a great potential to signicantly reduce the number of colors assignedand running time of the program.
%U https://ijnaa.semnan.ac.ir/article_4063_17f403a51f166a173016427ef4cb1f31.pdf