105 search results - page 3 / 21 » A lock-free multi-threaded algorithm for the maximum flow pr... |
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...
ALENEX
2009
13 years 8 months ago
2009
In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
CC
2006
Springer
13 years 11 months ago
2006
Springer
We show that classic PRE is also a maximum flow problem, thereby revealing the missing link between classic and speculative PRE, and more importantly, establishing a common high-le...
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...