MST
8 years 19 days ago
2016 MST
8 years 19 days ago
2016 MST
8 years 19 days ago
2016
Inspired by applications in parallel computing, we analyze the setting of work stealing in multithreaded computations. We obtain tight upper bounds on the number of steals when the...
MST
8 years 19 days ago
2016
An orientation of an undirected graph G is a directed graph obtained by replacing each edge {u, v} of G by exactly one of the arcs (u, v) or (v, u). In the min-sum k-paths orienta...
MST
8 years 19 days ago
2016 |