7 citations · 7 across the 1 of their papers we have counts for
1 paper
Paolo Boldi, Marco Rosa, Sebastiano Vigna
The neighbourhood function N(t) of a graph G gives, for each t, the number of pairs of nodes <x, y> such that y is reachable from x in less that t hops. The neighbourhood function…