It is proved that the minimum cut and maximum flow problems in directed planar networks with both node and edge capacities are both in NC.
而使用新方法可以得到NC算法，且可以证明节点和边都有容量的有向平面网络中的最小截、最大流问题都是属于NC的。
This algorithm translates the process of solving NNFPCSC into solving of many maximum flow problems, and provides a general frame for solving NNFPCSC.
算法将上述非线性问题转化为多个最大流问题求解，并为求解非线性可分凸费用网络流问题提出了通用的求解框架。
It is a trivial work to test whether a network is a small capacity network, so the algorithm of this paper is also useful for general maximum flow problems.
同时，由于判断一个网络是否为小容量网络非常简单，因此该算法也具有普遍意义。
It is a trivial work to test whether a network is a small capacity network, so the algorithm of this paper is also useful for general maximum flow problems.
同时，由于判断一个网络是否为小容量网络非常简单，因此该算法也具有普遍意义。
应用推荐