Centroids : a decentralized approach

Abstract : Centroid of a graph is a structure composed of nodes closest from all others. This suggests the idea of center of mass average of all edges, weighted by the local density or specific weight. Computing this centroid in a classic way needs a global view of the graph environment. In this paper, an algorithm using ant colony is proposed to compute an approximate solution of the cen- troid using a local view of the graph. This allows to study the centroids of complex networks such as protein-protein interaction networks and also thus generated by social interactions or Internet, for example.
Type de document :
Communication dans un congrès
ECCS - European Conference on Complex System, Sep 2011, Vienna, Austria. 2011
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00742845
Contributeur : Guilhelm Savin <>
Soumis le : mercredi 17 octobre 2012 - 13:33:17
Dernière modification le : mercredi 18 avril 2018 - 11:03:43
Document(s) archivé(s) le : vendredi 18 janvier 2013 - 03:45:25

Fichier

centroid-eccs2011.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00742845, version 1

Collections

Citation

Antoine Dutot, Damien Olivier, Guilhelm Savin. Centroids : a decentralized approach. ECCS - European Conference on Complex System, Sep 2011, Vienna, Austria. 2011. 〈hal-00742845〉

Partager

Métriques

Consultations de la notice

128

Téléchargements de fichiers

731