首页    期刊浏览 2025年02月26日 星期三
登录注册

文章基本信息

  • 标题:Solving Maximum Flow and Minimum Cut Network Problems by Labeling Method
  • 本地全文:下载
  • 作者:Radhe Shyam Soni ; S.P. Varma
  • 期刊名称:International Journal of Computer Science & Technology
  • 印刷版ISSN:2229-4333
  • 电子版ISSN:0976-8491
  • 出版年度:2015
  • 卷号:6
  • 期号:1
  • 页码:103-104
  • 语种:English
  • 出版社:Ayushmaan Technologies
  • 摘要:There are several methods available for the solution of maximum flow network problems. Labeling method is an alternative method for maximum flow network problems. The basic thing in the labeling procedure is to systematically attach labels to the nodes of a network until optimum solution is obtained. Labeling techniques can be used to solve different types of network problems. Such as shortest-path problems, maximal-flow problems, general minimalcost flow problems etc.
  • 关键词:Network;Labeling Technique;Maximum Flow;Minimum Cut etc
国家哲学社会科学文献中心版权所有