186 search results - page 1 / 38 » The Partial Augment-Relabel Algorithm for the Maximum Flow P... |
ESA
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
ICML
2008
IEEE
14 years 7 months ago
2008
IEEE
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...
AAIM
2009
Springer
14 years 27 days ago
2009
Springer
Abstract. We describe a two-level push-relabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bi...
IPPS
2008
IEEE
14 years 20 days ago
2008
IEEE
