13 citations · 13 across the 3 of their papers we have counts for
1 paper · 1 filter
N. Eggemann, S. D. Noble
We consider two orientation problems in a graph, namely the minimization of the sum of all the shortest path lengths and the minimization of the diameter. We show that it is NP-com…