There is at least one (1) distributed version propsosed for the push-relabel maximum-flow algorithm. I wonder if and how this algorithm can cope with nodes leaving or enterig the graph during runtime. Is there any work about this?1 Andrew V Goldberg and Robert E Tarjan. A new approach to themaximum-flow problem. Journal of the ACM (JACM), 35(4):921940,1988. google scholar
Distributed push relabel with changing graph topology
distributed systems;network flow