To access the full text documents, please follow this link: http://hdl.handle.net/2117/10482

A fast and efficient algorithm to identify clusters in networks
Comellas Padró, Francesc de Paula; Miralles de la Asunción, Alicia
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV; Universitat Politècnica de Catalunya. COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions
A characteristic feature of many relevant real life networks, like the WWW, Internet, transportation and communication networks, or even biological and social networks, is their clustering structure. We discuss in this paper a novel algorithm to identify cluster sets of densely interconnected nodes in a network. The algorithm is based on local information and therefore it is very fast with respect other proposed methods, while it keeps a similar performance in detecting the clusters.
Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors
Computer architecture
Computer networks
Graphs
Clusters
Networks
Complex systems
Clústers
Ordinadors, Xarxes d'
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
info:eu-repo/semantics/publishedVersion
Article
         

Show full item record

Related documents

Other documents of the same author

Comellas Padró, Francesc de Paula; Miralles de la Asunción, Alicia
Miralles de la Asunción, Alicia; Chen, Lichao; Zhang, Zhongzhi; Comellas Padró, Francesc de Paula
Comellas Padró, Francesc de Paula; Miralles de la Asunción, Alicia
Comellas Padró, Francesc de Paula; Miralles de la Asunción, Alicia
Comellas Padró, Francesc de Paula; Miralles de la Asunción, Alicia
 

Coordination

 

Supporters