Solving maximum flow problems on real-world bipartite graphs

DOI10.1145/1963190.2025381MaRDI QIDQ5406253zbMATH OpenOpenAlexFDO

Authors Cosmin Silvestru Negrucşeri, Mircea Bogdan Pacsoşi, Barbara Stanley, Cristian George Strat, Clifford Stein

Publication date 1 April 2014

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1963190.2025381

zbMATH Keywords

bipartite graphflowpreflow pushreal-world

Mathematics Subject Classification ID

Flows in graphs (05C21) Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35)

Recommendations

• Solving Maximum Flow Problems on Real World Bipartite Graphs
• Improved Algorithms for Bipartite Network Flow
• scientific article; zbMATH DE number 4104675
• The maximum flows in bipartite dynamic networks. The static approach
• Maximum flows in bipartite dynamic networks

Cited in

(5)

• Randomized OBDD-based graph algorithms
• Implicit computation of maximum bipartite matchings by sublinear functional operations
• Push-relabel based algorithms for the maximum transversal problem
• Solving Maximum Flow Problems on Real World Bipartite Graphs
• Power balance and apportionment algorithms for the United States Congress

This page was built for publication: Solving maximum flow problems on real-world bipartite graphs

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