5 citations · 5 across the 1 of their papers we have counts for
1 paper
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
Buß et al [KDD 2020] recently proved that the problem of computing the betweenness of all nodes of a temporal graph is computationally hard in the case of foremost and fastest path…