FIFO preflow algorithm for maximum flow in semi-bipartite networks

MaRDI QIDQ2806717zbMATH OpenFDO

Authors Laura Ciupală

Publication date 18 May 2016

Published in Bulletin of the Transilvania University of Brașov. Series III. Mathematics, Informatics, Physics (Search for Journal in Brave)

zbMATH Keywords

bipartite networkmaximum flownetwork flowsemi-bipartite network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Applications of mathematical programming (90C90)

Recommendations

• Wave algorithm for maximum flow in semi-bipartite networks
• Wave algorithm for maximum flow in bipartite networks
• Improved Algorithms for Bipartite Network Flow
• Analysis of Preflow Push Algorithms for Maximum Network Flow
• The maximum flows in bipartite dynamic networks. The static approach

Cited in

(4)

• Efficient preflow push algorithms
• An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
• Wave algorithm for maximum flow in semi-bipartite networks
• Wave algorithm for maximum flow in bipartite networks

This page was built for publication: FIFO preflow algorithm for maximum flow in semi-bipartite networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806717)