Abstract
We present a near-optimal distributed algorithm for (1 + o(1))-approximation of single-commodity maximum flow in undirected weighted networks that run......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
