Document is current

Any future updates will be listed below

The problem of finding the maximum multiple flow in the divisible network and its special cases

Crossref DOI link: https://doi.org/10.3103/S0146411616070191

Published Online: 2017-01-22

Published Print: 2016-12

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark