An efficient flow routing algorithm to solve the maximum concurrent flow problem with applications to the packed switched telecommunication networks and cluster analysis (abstract) - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Farhad Shahrokhi' in Google

runs on WebDSL