The maximum concurrent flow problem
Published in Journal of the ACM • Apr 1, 1990
NobleIDNI1P91W43R45S07
Authors:,
Farhad Shahrokhi
D. W. Matula
Abstract
The maximum concurrent flow problem (MCFP) is a multicommodity flow problem in which every pair of entities can send and receive flow concurrently. The ratio of the flow supplied between a pair of entities to the predefined demand for that pair is called throughput and must be the same for all pairs...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!