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

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.

     

/

返回文章
返回