The maximum homogenous flow problem in information network with single source/multiple sinks - solving method by successive search of augmenting tree

摘要

This paper presented the fundamental theory and an algorithm for maximum homogeneous flow problem in information network with single source and multiple sinks. Based on λ-dimensional flow-vector theory, new solving method is proposed where all possible augmenting trees with the source as a root are found. By experimental calculation, effectiveness and usefulness of proposed method are examined. The method presented here will play an essential role in future information network.