The maximum flows in bipartite dynamic networks. The static approach

MaRDI QIDQ4685176zbMATH OpenFDO

Authors Camelia Schiopu

Publication date 5 October 2018

zbMATH Keywords

bipartite dynamic network flowbipartite static network flowmaximum flow

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Maximum flows in bipartite dynamic networks
• Improved Algorithms for Bipartite Network Flow
• Constructing maximal dynamic flows from static flows
• Solving Maximum Flow Problems on Real World Bipartite Graphs
• Fast Algorithms for Bipartite Network Flow

Cited in

(11)

• FIFO preflow algorithm for maximum flow in semi-bipartite networks
• scientific article; zbMATH DE number 4204087 (Why is no real title available?)
• Maximum Bipartite Flow in Networks with Adaptive Channel Width
• Fast Algorithms for Bipartite Network Flow
• scientific article; zbMATH DE number 4104675 (Why is no real title available?)
• Improved Algorithms for Bipartite Network Flow
• Wave algorithm for maximum flow in semi-bipartite networks
• Maximum flows in bipartite dynamic networks
• Solving maximum flow problems on real-world bipartite graphs
• Maximum bipartite flow in networks with adaptive channel width
• The maximum flow in dynamic networks

This page was built for publication: The maximum flows in bipartite dynamic networks. The static approach

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