Improving Friends Matching in Social Networks Using Graph Coloring

Authors

  • Omayya Murad The University of Jordan
  • Azzam Sleit The University Of Jordan, Amman Jordan
  • Ahmad Sharaiah The University Of Jordan, Amman Jordan

DOI:

https://doi.org/10.24297/ijct.v15i8.1503

Keywords:

Algorithm, Graph coloring, Social Networks, Matching Friends.

Abstract

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. 

Downloads

Download data is not yet available.

Published

2016-06-22

How to Cite

Murad, O., Sleit, A., & Sharaiah, A. (2016). Improving Friends Matching in Social Networks Using Graph Coloring. INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 15(8), 7028-7034. https://doi.org/10.24297/ijct.v15i8.1503

Issue

Section

Articles