Algorithm model research of the logical cutting tree on the network maximum flow

Abstract

It is the complexity and the calculated quantities which require the use of the general algorithm for evaluating the maximum flow of the network. The logical cutting tree algorithm model of the network maximum flow is built using both the logical thought of the fault tree method and cutting set theories of the graphics. Therefore, the problem is resolved well and its calculation process is simpler and its logic is better than the original algorithm method.

Citation

Fang, Z., Liu, S. and Xu, B. (2004), "Algorithm model research of the logical cutting tree on the network maximum flow", Kybernetes, Vol. 33 No. 2, pp. 255-262. https://doi.org/10.1108/03684920410514184