Get Time
Search | Watch Thread  |  My Post History  |  My Watches  |  User Settings
View: Flat  | Threaded  | Tree
Previous Thread  |  Next Thread
Balanced maxflow | Reply
I am looking for an efficient algorithm for balanced maxflow in a digraph. By balanced I mean if there are mutiple paths from source to the sink node, the flow is divided in a balanced across participating edges.
For example consider the graph; G={(a,b,4),(b,c,4),(b,d,4),(c,e,4),(d,e,4) }
In this graph the maxflow from 'a' to 'e' is 4. The balanced maxflow is the one that carries 2 units along the edges (b,c),(b,d),(c,e),(d,e).

Subject Author Date
Balanced maxflow rdelaviz Oct 1, 2010 at 6:18 PM EDT
Re: Balanced maxflow kia Oct 2, 2010 at 5:58 PM EDT
Re: Balanced maxflow rdelaviz Oct 5, 2010 at 5:42 PM EDT