Bounds on maximum concurrent flow in random bipartite graphs
Crossref DOI link: https://doi.org/10.1007/s11590-020-01543-w
Published Online: 2020-02-10
Published Print: 2020-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Vilas, Fernando E. https://orcid.org/0000-0002-9125-2769
Olinick, Eli V.
Matula, David W.
Text and Data Mining valid from 2020-02-10
Version of Record valid from 2020-02-10
Article History
Received: 6 September 2019
Accepted: 31 January 2020
First Online: 10 February 2020