Detecting overlapping communities in linear time with P&A algorithm

Details Detecting overlapping communities in linear time with P&A algorithm Detecting overlapping communities in linear time with P&A algorithm

2005-09-30

arxiv.org/abs/physics/0509254v2

Physics

Physics and Society

Scientific paper

This paper describes a new algorithm - P&A algorithm - utilized in
identifying overlapping communities in non oriented valued graph regardless of
their number or their size. The complexity of this algorithm is minimal in the
matter that the number of operations grows linearly with the number of
vertices.

Affiliated with

Also associated with

No associations

Rating

Detecting overlapping communities in linear time with P&A algorithm 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 Detecting overlapping communities in linear time with P&A algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Detecting overlapping communities in linear time with P&A algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-683452