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.