Loading...
Loading...

Go to the content (press return)

A fast and efficient algorithm to identify clusters in networks

Author
Comellas, F.; Miralles, A.
Type of activity
Journal article
Journal
Applied mathematics and computation
Date of publication
2010-11-01
Volume
217
Number
5
First page
2007
Last page
2014
DOI
https://doi.org/10.1016/j.amc.2010.06.060 Open in new window
Repository
http://hdl.handle.net/2117/10482 Open in new window
Abstract
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.
Citation
Comellas, F.; Miralles, A. A fast and efficient algorithm to identify clusters in networks. "Applied mathematics and computation", 01 Novembre 2010, vol. 217, núm. 5, p. 2007-2014.
Keywords
Clusters, Complex systems, Graphs, Networks
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants