Farhad Shahrokhi. An efficient flow routing algorithm to solve the maximum concurrent flow problem with applications to the packed switched telecommunication networks and cluster analysis (abstract). In Lawrence A. Jehn, Larry A. Crum, editors, Proceedings of the 14th ACM Annual Conference on Computer Science, Cincinnati, Ohio, USA, 1986. pages 494, ACM, 1986. [doi]
@inproceedings{Shahrokhi86,
title = {An efficient flow routing algorithm to solve the maximum concurrent flow problem with applications to the packed switched telecommunication networks and cluster analysis (abstract)},
author = {Farhad Shahrokhi},
year = {1986},
doi = {10.1145/324634.325329},
url = {http://doi.acm.org/10.1145/324634.325329},
tags = {analysis, data-flow, data-flow analysis, routing},
researchr = {https://researchr.org/publication/Shahrokhi86},
cites = {0},
citedby = {0},
pages = {494},
booktitle = {Proceedings of the 14th ACM Annual Conference on Computer Science, Cincinnati, Ohio, USA, 1986},
editor = {Lawrence A. Jehn and Larry A. Crum},
publisher = {ACM},
isbn = {0-89791-177-6},
}