2 citations · 2 across the 5 of their papers we have counts for
1 paper · 1 filter
Aaron Berger, Jenny Kaufmann, Virginia Vassilevska Williams
The min-diameter of a directed graph G is a measure of the largest distance between nodes. It is equal to the maximum min-distance dmin(u,v) across all pairs u,v∈V(G),…