108 search results - page 2 / 22 » Two-Level Push-Relabel Algorithm for the Maximum Flow Proble... |
DISOPT
2008
13 years 6 months ago
2008
ESA
2006
Springer
13 years 11 months ago
2006
Springer
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...