5 citations · 8 across the 5 of their papers we have counts for
1 paper · 1 filter
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
We consider the problem of assigning appearing times to the edges of a digraph in order to maximize the (average) temporal reachability between pairs of nodes. Motivated by the app…