Abstract
This article presents three protocols for obtaining maximum flow in a network by using distributed computation. Each node in the network has memory and processing capabilities and coordinates the algorithm with its neighbors by means of control messages. In the order presented, each protocol employs less communication than the previous one, but requires more time and node computation.
| Original language | English |
|---|---|
| Pages (from-to) | 213-230 |
| Number of pages | 18 |
| Journal | Networks |
| Volume | 12 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1982 |
| Externally published | Yes |