Maximum flow based model and method of the maximum lifetime problem of sensor networks 求解传感器网络最大生存时间的最大流算法
Maximum flow rate 最大流率
An application on minimum cost and maximum flow model to flight connecting problem in single hub and spoke network 最小费用最大流模型在航班衔接问题中的应用
Abstract concerning the problems in flow algorithm on network , a new algorithm with strong applicability was studied 摘要针对目前网络最大流算法存在的问题，研究一种适应性更广的新算法。
In the conclusion section , we point out the results and improvement we have made and further research work we need to do 将网络需求分布与网络最大流问题相结合，提出了基于固定需求格局之下的网络最大流问题。
Algorithm testing shows : the new maximum flow algorithm in network with both node and edge capacity confined is completely feasible and availability effective 算法测试表明：点和边有容量约束的网络最大流新算法是完全可行和有效的。
4 . a famous depth minimization algorithm flowmap is described and implemented . a new technology are applied in computing maximal flow of a boolean network 4 .自主实现了flowmap算法,利用布尔网络的特点,采用新的标号法求得网络的最大流。
The flow network is mainly studied in the network flow problem and it calls for the determination of the maximum flow or the minimum cost flow of the flow network 网络流问题主要以流网络为研究对象，要求求出流网络中的最大流或最小费用流。
Last , use the minimum cost and maximum flow method in graph theory to solve the problem . the result got is relativel y accurate and the solving process is quite fast and simple 问题求解利用网络流中的最小费用最大流算法，既保证了必要的精度，又使得问题求解快速、简单。
Paths from start point to end point are founded , and the max - flow of boolean network is got by this way , which avoid conversion of graphics , and time complexity is lowered as well 本论文利用标号法寻求起始点到终点的通路的方法,来求得布尔网络的最大流,使得图的变换减少,时间复杂度也随之减少。
