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

XIE Ji-ping; YANG Chao; XIE Gang

doi:10.11929/j.issn.2095-1914.2005.02.019

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

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

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

Graphical Abstract

Abstract

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.

FullText(HTML)

References (0)

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

Abstract

Catalog

Export File

Citation

Format

Content