Computer Science – Social and Information Networks
Scientific paper
2011-11-13
Computer Science
Social and Information Networks
5 pages
Scientific paper
In this note, we explore a connection between the small-set expansion problem
and a popular community finding approach for social networks, and observe that
a sub-exponential time small-set expansion algorithm can be used to provide a
sub-exponential time 2-approximation for hard instances of the community
finding problem.
DasGupta Bhaskar
Desai Devendra
No associations
LandOfFree
A Remark on a Connection Between Small Set Expansions and Modularity Clustering in Social Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Remark on a Connection Between Small Set Expansions and Modularity Clustering in Social Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Remark on a Connection Between Small Set Expansions and Modularity Clustering in Social Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-340853