Solving Maximum Flow Problems on Real World Bipartite Graphs

DOI10.1137/1.9781611972894.2zbMath1430.90548OpenAlexW2179141848MaRDI QIDQ5233562

Barbara Stanley, Cristian George Strat, Cosmin Silvestru Negruşeri, Mircea Bogdan Paşoi, Clifford Stein

Publication date: 11 September 2019

Published in: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972894.2

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Related Items (1)

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