Online Max-flow Learning via Augmenting and De-augmenting Path

This paper presents an augmenting path based online max-flow algorithm. The proposed algorithm handles graph changes in chunk manner, updating residual graph in response to edge capacity increase, decrease, edge/node adding and removal. All possible graph changes are abstracted into two key graph changes, which are capacity decrease and i...More