Abstract

Now a days we are using various type of social networking .which include only friends and relatives, not including unknown person without our permission .But the Growth of social networking is location based services. It includes both location and social networking. In the Exiting system, we are using unweighted graph. so we can’t get exact solution. In order to overcome this problem, we move on to weighted social graph which leads to get an exact solution. Here we are using Enhanced SAR tree algorithm which is used to branch and bounding the users in the group. Then K-Cover group algorithm which is used to retrieve the minimum number of users in the group.

Authors and Affiliations