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.