108 search results - page 5 / 22 » Two-Level Push-Relabel Algorithm for the Maximum Flow Proble... |
CORR
2011
Springer
13 years 1 months ago
2011
Springer
We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniqu...
FMCAD
2007
Springer
14 years 1 months ago
2007
Springer
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
WAOA
2005
Springer
14 years 28 days ago
2005
Springer
ICCSA
2005
Springer
14 years 29 days ago
2005
Springer
The major objective of this paper is to deploy an effective evolutionary algorithm (EA) for the congestion problem in connection-oriented networks. The network flow is modeled as n...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...