DOI: 10.36347/sjpms

Pages: 77-83

Maximum flow problem on hypergraphs (hyper-networks) is an extension of maximum flow problem on normal graphs. In this report, we discuss a generalized fuzzy version of maximum flow problem in hyper-networks setting, and a new fuzzy maximum flow algorithm in hyper-network setting is obtained. Our algorithm mainly based on fuzzy set theory and incremental graph, and the technology of  -cut is also employed to determine the fuzzy maximum flow. The implement procedure is manifested at last