108 search results - page 8 / 22 » Two-Level Push-Relabel Algorithm for the Maximum Flow Proble... |
ESA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes whic...
JACM
2007
13 years 7 months ago
2007
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
GLOBECOM
2008
IEEE
13 years 7 months ago
2008
IEEE
It has been shown that network coding can lead to significant improvement in network capacity and reduction in power consumption for multicast traffic in wireless networks. In this...
MEMICS
2010
13 years 2 months ago
2010
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...