Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games - Inria - Institut national de recherche en sciences et technologies du numérique
Article Dans Une Revue Theoretical Computer Science Année : 2015

Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games

Michele Borassi
  • Fonction : Auteur
  • PersonId : 974705
IMT Institute of Advanced Studies
Pierluigi Crescenzi
Dipartimento di Ingegneria dell'Informazione [Firenze]
Michel Habib
Networks, Graphs and Algorithms
Walter A. Kosters
  • Fonction : Auteur
  • PersonId : 974707
Leiden Institute of Advanced Computer Science [Leiden]
Andrea Marino
Dipartimento di Informatica
Frank W. Takes
  • Fonction : Auteur
  • PersonId : 974708
Leiden Institute of Advanced Computer Science [Leiden]

Résumé

We discuss very effcient diameter computation algorithms and applied them on huge graphs.

Domaines

Informatique [cs] Algorithme et structure de données [cs.DS]

Michel Habib  : Connectez-vous pour contacter le contributeur

https://inria.hal.science/hal-01255125

Soumis le : mercredi 13 janvier 2016-11:08:15

Dernière modification le : vendredi 8 novembre 2024-16:08:02

Consulter le texte intégral

Dates et versions

hal-01255125 , version 1 (13-01-2016)

Identifiants

Citer

Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, et al.. Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games. Theoretical Computer Science, 2015, 586, pp.21. ⟨10.1016/j.tcs.2015.02.033⟩. ⟨hal-01255125⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-PARIS7 CNRS INRIA INRIA2
90 Consultations
0 Téléchargements

Altmetric

Partager

More