Decentralized maximum‐flow protocols
Copyright policy )Decentralized maximum‐flow protocols
AbstractThis 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.
maximum flow in a network, algorithm, nodes with memory, distributed computation, control messages, Programming involving graphs or networks, capacitated network, Numerical mathematical programming methods, Deterministic network models in operations research, decentralized regulation of flow
maximum flow in a network, algorithm, nodes with memory, distributed computation, control messages, Programming involving graphs or networks, capacitated network, Numerical mathematical programming methods, Deterministic network models in operations research, decentralized regulation of flow
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).12 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!