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
Document type :
Journal articles
Complete list of metadatas
https://hal.inria.fr/hal-01255125
Contributor : Michel Habib <>
Submitted on : Wednesday, January 13, 2016 - 11:08:15 AM
Last modification on : Wednesday, August 21, 2019 - 9:02:03 PM

Links full text

openaccess

Identifiers

Collections

CNRS | UNIV-PARIS7 | INRIA | USPC | INRIA-ROCQ

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

210

Contact


archive-ouverte@inria.fr