Improving Friends Matching in Social Networks Using Graph Coloring
Journal: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY (Vol.15, No. 8)Publication Date: 2016-05-19
Authors : Omayya Murad; Azzam Sleit; Ahmad Sharaiah;
Page : 7028-7034
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.?
Other Latest Articles
- DEVELOPING A CONCEPTUAL MODEL OF FACTORS AFFECTING SOCIAL MEDIA NETWORKING USAGE IN E-LEARNING AT TALAL ABU GHAZELEH UNIVERSITY COLLEGE OF BUSINESS (TAGUCB) IN BAHRAIN
- SECURITY MECHANISMS AND ANALYSIS FOR INSECURE DATA STORAGE AND UNINTENDED DATA LEAKAGE FOR MOBILE APPLICATIONS
- Role-Attribute-Based Encryption (RABE) Access Control for Healthcare Cloud Systems
- P-Codec: Parallel Compressed File Decompression Algorithm for Hadoop
- LOAD BALANCING IN CLOUD ENVIRONMENT: A REVIEW
Last modified: 2016-06-29 15:09:30