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

IJCNN, pp. 1-8, 2018.

Cited by: 0|Views25


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



Get fulltext within 24h
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.


Upload a single paper

for 5 coins

Wechat's Red Packet

Upload 50 articles

for 250 coins

Wechat's Red Packet

Upload 200 articles

for 1000 coins

Wechat's Red Packet

Upload 500 articles

for 2500 coins

Wechat's Red Packet

Upload 1000 articles

for 5000 coins

Wechat's Red Packet
Your rating :