arXiv · physics/0509254
Detecting overlapping communities in linear time with P&A algorithm
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Nicolas Pissard, Houssem Assadi. 2005-10-20. Detecting overlapping communities in linear time with P&A algorithm. https://arxiv.org/abs/physics/0509254
Cite the original work for its findings. Save a collection to share your selection of sources.