Improving Friends Matching in Social Networks Using Graph Coloring
Recently, most of people have their own profiles in different social networks. Usually, their profiles have some brief description about their personnel picture, family members, home town, career, date of birth etc. which indicate other people know some general information about others. In social networks, usually friends recommendation is done by finding the most mutual friends and suggest them to be friends. In this paper, we will introduce an algorithm, with a linear time complexity, that helps people to get not only good friends but alsoÂ have same characteristics.Â
Copyright (c) 2016 INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors retain the copyright of their manuscripts, and all Open Access articles are distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided that the original work is properly cited.