We design a stateless and distributed solution to the problem of maximum multicommodity flows--route the maximum amount of flow between given source-sink pairs, possibly split along several paths, subject to edge-capacity constraints. Our main ...
For k 1 , the k-commodity flow problem is, we are given k pairs of vertices in a graph G, and we ask whether there exist k flows in the graph, wherethe ith flow is between the ith pair of vertices, and has total value one; andfor each edge e, the sum of ...
This paper considers the multicommodity flow problem and the integer multicommodity flow problem on cycle graphs. We present two linear time algorithms for solving each of the two problems.
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in