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

被引：5

作者：

Fang, Z ^{[1
]}

Liu, SF

Xu, BG

机构：

[1] Nanjing Univ Aeronaut & Astronaut, Coll Econ & Management, Nanjing 210016, Peoples R China

[2] Chinese Acad Sci, Inst Policy & Management, Beijing, Peoples R China

来源：

KYBERNETES | 2004年 / 33卷 / 02期

关键词：

cybernetics; network operating systems; flow measurement;

D O I：

10.1108/03684920410514184

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 wed and its calculation process is simpler and its logic is better than the original algorithm method.

引用

页码：255 / 262

页数：8