On computing the diameter of real-world undirected graphs☆
Under an Elsevier user license
open archive
Keywords
Breadth-first search
Diameter
Complex network
Experimental analysis
Cited by (0)
- ☆
This research was supported in part by funds of the following projects or institutions: “DISCO” PRIN (National Research Project), “AlgoDEEP” PRIN (National Research Project), Florence section of INFN (National Institute of Nuclear Physics).
Copyright © 2012 Elsevier B.V. All rights reserved.