解季萍, 杨超, 谢刚. 网络最大流问题和典型阻塞流算法研究[J]. 西南林业大学学报, 2005, 25(2): 71-72,76. DOI: 10.11929/j.issn.2095-1914.2005.02.019
引用本文: 解季萍, 杨超, 谢刚. 网络最大流问题和典型阻塞流算法研究[J]. 西南林业大学学报, 2005, 25(2): 71-72,76. DOI: 10.11929/j.issn.2095-1914.2005.02.019
shu
XIE Ji-ping, YANG Chao, XIE Gang. Maximum-flow Problem of Networks and Algorithms of Typical Flow Decomposition Barrier[J]. Journal of Southwest Forestry University, 2005, 25(2): 71-72,76. DOI: 10.11929/j.issn.2095-1914.2005.02.019
Citation: XIE Ji-ping, YANG Chao, XIE Gang. Maximum-flow Problem of Networks and Algorithms of Typical Flow Decomposition Barrier[J]. Journal of Southwest Forestry University, 2005, 25(2): 71-72,76. DOI: 10.11929/j.issn.2095-1914.2005.02.019
shu

网络最大流问题和典型阻塞流算法研究

Maximum-flow Problem of Networks and Algorithms of Typical Flow Decomposition Barrier

    摘要
  • 摘要: 简述了网络最大流问题并给出相应的数学模型,在此基础上详细解析了网络最大流问题中的两个典型阻塞流算法:Dinic阻塞流算法、Goldberg和Rao的二分长度阻塞流算法。

     

    Abstract: The condition of the maximum flow problem was proposed and a mathematical model was set up.Two typical algorithms, i.e., Dinic flow decomposition barrier Algorithms and Goldberg &Rao flow decomposition barrier Algorithms to tackle with the maximum-flow problem of networks were elaborated in details.

     

    • HTML全文
    • 参考文献(0)
    • 相关文章
    • 施引文献
  • 资源附件(0)

/

返回文章
返回