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 1 Pierluigi Crescenzi 2 Michel Habib 3 Walter Kosters 4 Andrea Marino 5 Frank Takes 4
1 IMT Institute of Advanced Studies
2 DINFO - Dipartimento di Ingegneria dell'Informazione [Firenze]
3 GANG - Networks, Graphs and Algorithms
LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt
4 LIACS - Leiden Institute of Advanced Computer Science [Leiden]
5 ISLab - Dipartimento di Informatica
Abstract : We discuss very effcient diameter computation algorithms and applied them on huge graphs.
Keywords : Graphs Algorithms diameter computations
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2015, 586, pp.21. 〈10.1016/j.tcs.2015.02.033〉
Liste complète des métadonnées
https://hal.inria.fr/hal-01255125
Contributeur : Michel Habib <>
Soumis le : mercredi 13 janvier 2016 - 11:08:15
Dernière modification le : vendredi 25 mai 2018 - 12:02:05

Lien texte intégral

openaccess

Identifiants

Collections

INRIA | USPC

Citation

Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter 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, Elsevier, 2015, 586, pp.21. 〈10.1016/j.tcs.2015.02.033〉. 〈hal-01255125〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

167

Contact


archive-ouverte@inria.fr