Detecting overlapping communities in linear time with P&A algorithm

Simple item page
dc.creatorPissard, Nicolas
dc.creatorAssadi, Houssem
dc.date2005-09-30
dc.date2005-10-20
dc.date.accessioned2026-07-07T06:43:28Z
dc.date.available2026-07-07T06:43:28Z
dc.descriptionThis 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.
dc.identifierhttps://arxiv.org/abs/physics/0509254
dc.identifierhttp://arxiv.org/abs/physics/0509254
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/102427
dc.subjectPhysics and Society
dc.titleDetecting overlapping communities in linear time with P&A algorithm
dc.typetext

Files

Collections

arXiv