On computing the diameter of real-world undirected graphs