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

Abstract : We discuss very effcient diameter computation algorithms and applied them on huge graphs.
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

Identifiers

Collections

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⟩

Share

Metrics

Record views

210