max-flow meaning in Chinese

最大流

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
本论文利用标号法寻求起始点到终点的通路的方法,来求得布尔网络的最大流,使得图的变换减少,时间复杂度也随之减少。
By using network flow theory , the optimization problem of power conservation is transformed into the optimal bipartition problem of a flow network which can be partitioned by the max - flow mm - cut algorithm
利用网络流理论，将节约电量的最优化问题转化为一个流网络的最优分割问题，而后者可采用最大流最小切割算法实现最优切分。
Based on the above elementary problems , the relation between system and user equilibrium patterns is discussed and the realization of so pattern is presented . the gap between the user equlirium and system optium is a key factor of the evoluation of the network . and the capcity of a given network is the extension of the max - flow problem
在网络需求相对固定后，系统最优目标值和用户平衡目标值之间的距离是一个重要参考指标，为宏观调控留下了空间，通过注入管理信息或改变网络使用者的网络费用矩阵，可以达到用户平衡下的行为实现系统最优的目标。