3 citations · 3 across the 6 of their papers we have counts for
1 paper · 1 filter
Gruia Calinescu
Given a directed simple graph G=(V,E) and a nonnegative-valued cost function the power of a vertex u in a directed spanning subgraph H is given by the maximum cost of an arcs of H…