|
|
|
|
|
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci and Eli Upfal
We present an algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction. In order to be efficient in terms of both time and space, our algorithm is based on a decomposi...
ver más
|
|
|
|
|