Solving maximum flow problems on real-world bipartite graphs

DOI10.1145/1963190.2025381zbMath1284.90090OpenAlexW2068825973MaRDI QIDQ5406253

Barbara Stanley, Cosmin Silvestru Negrucşeri, Cristian George Strat, Mircea Bogdan Pacsoşi, 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 graphflowreal-worldpreflow push

Mathematics Subject Classification ID

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

Related Items (2)

Randomized OBDD-based graph algorithms ⋮ Implicit computation of maximum bipartite matchings by sublinear functional operations

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