1 paper
Gabriele Santi, Leonardo De Laurentiis
We present an implementation and an experimental evaluation of an algorithm that, given a connected graph G (represented by adjacency lists), estimates in sublinear time, with a re…