Decentralized maximum flow algorithms
Adrian Segall · Defense Technical Information Center (DTIC) · 1979
This paper presents three algorithms for obtaining maximum flow in a network using distributed computation. Each node in the network has memory and processing capabilities and coordinates the algorithm with its neighbors using control messages. Each of the last two versions requires more sophistication at the nodes than the previous one, but on the other hand employs less communication. (Author)