AbstractWe prove that if s, s′, t, t′ are vertices of a graph, and no path of fewer than k edges joins s to s′ or t to t′, then there are 2k sets of edges, each meeting every path from s to s′ and from t to t′, such that no edge is in more than two of them. This result is dual to Hu's two-commodity flow theorem
AbstractWe consider the undirected maximum multiflow (multicommodity flow) problem in the case when ...
We prove that for every 3-edge-connected graph G there exists a partition of E(G) into at most nine ...
AbstractWe consider a path packing problem: given a supply graph G with a node-set N and a demand gr...
AbstractWe prove that if s, s′, t, t′ are vertices of a graph, and no path of fewer than k edges joi...
The max-flow min-cut theorem and the two-commodity flow theorem may both be interpreted as equalitie...
AbstractThe max-flow min-cut theorem of Ford and Fulkerson (for undirected networks) may be regarded...
AbstractWe give simple algorithmic proofs of some theorems of17and970549on the packing of metrics by...
Aharoni et al. [Ron Aharoni et al., 2010] proved the max-flow min-cut theorem for countable networks...
In a multicommodity flow problem, the goal is to route paths in a supply graph G to satisfy demands ...
AbstractSuppose that G is a graph, and (si,ti) (1≤i≤k) are pairs of vertices; and that each edge has...
We compare two multicommodity flow problems, the maximum sum of flow, and the maximum concurrent flo...
AbstractWe prove a strong version of the Max-Flow Min-Cut theorem for countable networks, namely tha...
Abstract For k ≥ 1, the k-commodity flow problem is, we are given k pairs of vertices in a graph G, ...
We consider the problem of multicommodity flows in planar graphs. Seymour [Seymour, 1981] showed tha...
AbstractWe prove that, if a graph G (without multiple edges) has maximum degree d and edge-chromatic...
AbstractWe consider the undirected maximum multiflow (multicommodity flow) problem in the case when ...
We prove that for every 3-edge-connected graph G there exists a partition of E(G) into at most nine ...
AbstractWe consider a path packing problem: given a supply graph G with a node-set N and a demand gr...
AbstractWe prove that if s, s′, t, t′ are vertices of a graph, and no path of fewer than k edges joi...
The max-flow min-cut theorem and the two-commodity flow theorem may both be interpreted as equalitie...
AbstractThe max-flow min-cut theorem of Ford and Fulkerson (for undirected networks) may be regarded...
AbstractWe give simple algorithmic proofs of some theorems of17and970549on the packing of metrics by...
Aharoni et al. [Ron Aharoni et al., 2010] proved the max-flow min-cut theorem for countable networks...
In a multicommodity flow problem, the goal is to route paths in a supply graph G to satisfy demands ...
AbstractSuppose that G is a graph, and (si,ti) (1≤i≤k) are pairs of vertices; and that each edge has...
We compare two multicommodity flow problems, the maximum sum of flow, and the maximum concurrent flo...
AbstractWe prove a strong version of the Max-Flow Min-Cut theorem for countable networks, namely tha...
Abstract For k ≥ 1, the k-commodity flow problem is, we are given k pairs of vertices in a graph G, ...
We consider the problem of multicommodity flows in planar graphs. Seymour [Seymour, 1981] showed tha...
AbstractWe prove that, if a graph G (without multiple edges) has maximum degree d and edge-chromatic...
AbstractWe consider the undirected maximum multiflow (multicommodity flow) problem in the case when ...
We prove that for every 3-edge-connected graph G there exists a partition of E(G) into at most nine ...
AbstractWe consider a path packing problem: given a supply graph G with a node-set N and a demand gr...
DOI
Add to ORKG