# Search results

2014 IEEE Global Communications Conference > 228 - 233

Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne > 2013 > nr 6 > 180--185

Discrete Applied Mathematics > 2012 > 160 > 15 > 2208-2220

Journal of Combinatorial Optimization > 2012 > 24 > 4 > 526-539

*G*=(

*N*,

*E*), a subset

*T*of its nodes and an undirected graph (

*T*,

*S*),

*G*and (

*T*,

*S*) together are often called a network. A collection of paths in

*G*whose end-pairs lie in

*S*is called an integer multiflow. When these paths are allowed to have fractional weight, under the constraint that the total weight of the paths traversing a single edge does not exceed 1, we have a fractional...

Differential Equations and Dynamical Systems > 2010 > 18 > 4 > 401-414

*X*together with a finite collection of self-maps on

*X*is called a multiple discrete flow. We develop the theory of fair convergence for multiple flows and show how the UNITY programs of Chandy and Misra can be reformulated in terms of this theory.

Annals of Operations Research > 2010 > 181 > 1 > 709-722

*s*–

*t*flow for one of the sources–sinks pairs

*s*–

*t*, but only measures on some arcs are available, at least on one

*s*–

*t*

*cocycle*(set of arcs having exactly one endpoint in a subset

*X*of vertices with

*s*∈

*X*and

*t*∉

*X*). These measures, supposed to be unbiased, are...

Journal of Combinatorial Optimization > 2009 > 17 > 2 > 192-205

*G*be a supply graph, with the node set

*N*and edge set

*E*, and (

*T*,

*S*) be a demand graph, with

*T*⊆

*N*,

*S*∩

*E*=

*∅*. Observe paths whose end-vertices form pairs in

*S*(called

*S*-

*paths*). The following

*path packing problem*for graphs is fundamental: what is the maximal number of

*S*-paths in

*G*? In this paper this problem is studied under two assumptions: (a) the node degrees in

*N*∖

*T*are even, and (b) any three distinct...

Discrete Applied Mathematics > 2007 > 155 > 13 > 1715-1730