Advertisement
Published in:
2015 | OriginalPaper | Chapter
An Improved Algorithm of Network Maximum Flow Based on Network Flow Matrix
Authors : ZhenChao Wang, LiPing Zhang, WeiDong Hao
Published in: Advanced Multimedia and Ubiquitous Engineering
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this paper, the algorithm of network maximum flow based on network flow matrix is introduced first, then some new properties of network flow matrix are studied according to max-flow min-cut theorem, and on this basis the improved algorithm of network maximum flow based on network flow matrix is given. In this way, the matrix can be reduced order directly when it satisfies certain particular conditions and be translated into several matrices when its order is large, thus simplifying the original algorithm.