186 search results - page 1 / 38 » The Partial Augment-Relabel Algorithm for the Maximum Flow P... |
78
Voted
ESA
2008
Springer
15 years 1 days 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...
79
Voted
CORR
2010
Springer
14 years 10 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...
108
click to vote
ICML
2008
IEEE
15 years 11 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...
77
Voted
AAIM
2009
Springer
15 years 4 months 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
15 years 4 months ago
2008
IEEE
