Abstract
In this paper we provide an algorithm for maintaining a (1 - epsilon)-approximate maximum flow in a dynamic, capacitated graph undergoing edge inserti......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
