Detection of Communities in Directed Networks based on Strongly p-Connected Components

Abstract : A lot of algorithms in communities detection have been proposed particularly for undirected networks. As methods to find communities in directed networks are few, our contribution is to propose a method based on strongly and unilaterally connected components, and more specifically on strongly p-connected components in directed graphs. The result is a clustering of nodes giving good results in generated graphs according to several clustering evaluation measures, and which practical time complexity remains acceptable.
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00634309
Contributor : Vincent Levorato <>
Submitted on : Wednesday, July 18, 2012 - 4:14:07 PM
Last modification on : Wednesday, October 9, 2019 - 1:36:40 AM
Long-term archiving on : Friday, December 16, 2016 - 12:53:01 AM

File

CASON2011-VLCP_v2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00634309, version 2

Citation

Vincent Levorato, Coralie Petermann. Detection of Communities in Directed Networks based on Strongly p-Connected Components. (CASoN), Oct 2011, Salamanca, Spain. pp.211-216. ⟨hal-00634309v2⟩

Share

Metrics

Record views

202

Files downloads

619