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 Accéder directement au contenu
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

Résumé

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

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⟩
78 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More