Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
An Improved Algorithm of Network Maximum Flow Based on Network Flow Matrix
verfasst von : ZhenChao Wang, LiPing Zhang, WeiDong Hao
Erschienen in: Advanced Multimedia and Ubiquitous Engineering
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.