| 57 | 0 | 8 |
| Downloads | Citas | Reads |
The problem of the network maximum current and its application on many fields of engineering and science are introduced.On the basis of this,the conception of the key degree of network is given,and an application of the key degree on the transportation net is discussed.
[1]AHUJA R K,MAGNANTI T L,ORLIN J B.Network flows:theory,algorithms and applications[M].New Jersey:Pren-tice Hall,1993.
[2]GOLDBERG A V.Recent developments in maximum flow algorithms(Invited lecture)[C].In:ARNBORG S,IVANSSONL eds.Proc of the Sixth Scandinavian Workshop on Algorithm Theory(LNCS 1004).Heidelbeng:Springer-Verlag,1998:1-10.
[3]李作安,谢凡荣.运输网络中求最大容量路的一个算法[J].四川大学学报:自然科学版,1999,36(3):467-471.
[4]谢凡荣.求解运输问题的一个算法[J].运筹与管理,2002,11(3):69-73.
[5]张宪超,陈国良,万颖瑜.网络最大流问题研究与发展[J].计算机研究与发展,2003,40(9):1281-1292.
[6]谢凡荣.求解网络最大流问题的一个算法[J].运筹与管理,2004,13(4):37-40.
Basic Information:
China Classification Code:O157.5
Citation Information:
[1]WANG Zhi-jun~1,CHENG Zhi-qian~2(1.Zhengzhou Teachers College,Zhengzhou 450044,China,2.Luoyang Technology College,Luoyang 471003,China).On Network Key Degree and Its Applications[J].Journal of Zhengzhou University(Natural Science Edition),2006(02):32-35.
2006-06-30
2006-06-30