-
1
-
-
78149333157
-
An efficient graph cut algorithm for computer vision problems
-
Daniilidis, K. (ed.) LNCS Springer, Heidelberg
-
Arora, C., Banerjee, S., Kalra, P., Maheshwari, S.: An Efficient Graph Cut Algorithm for Computer Vision Problems. In: Daniilidis, K. (ed.) ECCV 2010, Part III. LNCS, vol. 6313, pp. 552-565. Springer, Heidelberg (2010)
-
(2010)
ECCV 2010, Part III
, vol.6313
, pp. 552-565
-
-
Arora, C.1
Banerjee, S.2
Kalra, P.3
Maheshwari, S.4
-
2
-
-
4344598245
-
An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
-
Boykov, Y., Kolmogorov, V.: An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. IEEE transactions on Pattern Analysis and Machine Intelligence 26(9), 1124-1137 (2004)
-
(2004)
IEEE Transactions on Pattern Analysis and Machine Intelligence
, vol.26
, Issue.9
, pp. 1124-1137
-
-
Boykov, Y.1
Kolmogorov, V.2
-
3
-
-
84892250260
-
Graph cuts in vision and graphics: Theories and applications
-
Paragios, N., Chen, Y., Faugeras, O. (eds.) Springer, Heidelberg
-
Boykov, Y., Veksler, O.: Graph Cuts in Vision and Graphics: Theories and Applications. In: Paragios, N., Chen, Y., Faugeras, O. (eds.) Handbook of Mathematical Models in Computer Vision, pp. 109-131. Springer, Heidelberg (2006)
-
(2006)
Handbook of Mathematical Models in Computer Vision
, pp. 109-131
-
-
Boykov, Y.1
Veksler, O.2
-
4
-
-
65349164219
-
A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem
-
Chandran, B., Hochbaum, D.: A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem. Operations Research 57, 358-376 (2009)
-
(2009)
Operations Research
, vol.57
, pp. 358-376
-
-
Chandran, B.1
Hochbaum, D.2
-
5
-
-
1842597952
-
A fast algorithm for computing maximum flow in a network
-
Karzanov, A.V. (ed.) The Institute for Systems Studies, Moscow (in Russian)
-
Cherkassky, B.V.: A Fast Algorithm for Computing Maximum Flow in a Network. In: Karzanov, A.V. (ed.) Collected Papers. Combinatorial Methods for Flow Problems, vol. 3, pp. 90-96. The Institute for Systems Studies, Moscow (1979) (in Russian);
-
(1979)
Collected Papers. Combinatorial Methods for Flow Problems
, vol.3
, pp. 90-96
-
-
Cherkassky, B.V.1
-
6
-
-
80052822117
-
-
English translation appears in
-
English translation appears in AMS Trans. 158, 23-30 (1994)
-
(1994)
AMS Trans.
, vol.158
, pp. 23-30
-
-
-
7
-
-
0000122499
-
On implementing push-relabel method for the maximum flow problem
-
Cherkassky, B.V., Goldberg, A.V.: On Implementing Push-Relabel Method for the Maximum Flow Problem. Algorithmica 19, 390-410 (1997)
-
(1997)
Algorithmica
, vol.19
, pp. 390-410
-
-
Cherkassky, B.V.1
Goldberg, A.V.2
-
8
-
-
0003346462
-
Application of the simplex method to a transportation problem
-
Koopmans, T.C. (ed.) Wiley, New York
-
Dantzig, G.B.: Application of the Simplex Method to a Transportation Problem. In: Koopmans, T.C. (ed.) Activity Analysis and Production and Allocation, pp. 359-373. Wiley, New York (1951)
-
(1951)
Activity Analysis and Production and Allocation
, pp. 359-373
-
-
Dantzig, G.B.1
-
9
-
-
0000891810
-
Algorithm for solution of a problem of maximum flow in networks with power estimation
-
Dinic, E.A.: Algorithm for Solution of a Problem of Maximum Flow in Networks with Power Estimation. Soviet Math. Dokl. 11, 1277-1280 (1970)
-
(1970)
Soviet Math. Dokl.
, vol.11
, pp. 1277-1280
-
-
Dinic, E.A.1
-
11
-
-
70350630336
-
Two-level push-relabel algorithm for the maximum flow problem
-
Goldberg, A.V., Zhou, Y. (eds.) LNCS Springer, Heidelberg
-
Goldberg, A.V.: Two-Level Push-Relabel Algorithm for the Maximum Flow Problem. In: Goldberg, A.V., Zhou, Y. (eds.) AAIM 2009. LNCS, vol. 5564, pp. 212-225. Springer, Heidelberg (2009)
-
(2009)
AAIM 2009
, vol.5564
, pp. 212-225
-
-
Goldberg, A.V.1
-
12
-
-
0032157143
-
Beyond the flow decomposition barrier
-
Goldberg, A.V., Rao, S.: Beyond the Flow Decomposition Barrier. J. Assoc. Comput. Mach. 45, 753-782 (1998)
-
(1998)
J. Assoc. Comput. Mach.
, vol.45
, pp. 753-782
-
-
Goldberg, A.V.1
Rao, S.2
-
14
-
-
27144461131
-
A computational comparison of the dinic and network simplex methods for maximum flow
-
Goldfarb, D., Grigoriadis, M.D.: A Computational Comparison of the Dinic and Network Simplex Methods for Maximum Flow. Annals of Oper. Res. 13, 83-123 (1988)
-
(1988)
Annals of Oper. Res.
, vol.13
, pp. 83-123
-
-
Goldfarb, D.1
Grigoriadis, M.D.2
-
15
-
-
0011620023
-
Network flows and matching: First DIMACS implementation challenge
-
Providence
-
Johnson, D.S., McGeoch, C.C.: Network Flows and Matching: First DIMACS Implementation Challenge. AMS, Providence (1993)
-
(1993)
AMS
-
-
Johnson, D.S.1
McGeoch, C.C.2
-
16
-
-
0001137959
-
Determining the maximal flow in a network by the method of preflows
-
Karzanov, A.V.: Determining the Maximal Flow in a Network by the Method of Preflows. Soviet Math. Dok. 15, 434-437 (1974)
-
(1974)
Soviet Math. Dok.
, vol.15
, pp. 434-437
-
-
Karzanov, A.V.1
-
17
-
-
0000517038
-
A faster deterministic maximum flow algorithm
-
King, V., Rao, S., Tarjan, R.: A Faster Deterministic Maximum Flow Algorithm. J. Algorithms 17, 447-474 (1994)
-
(1994)
J. Algorithms
, vol.17
, pp. 447-474
-
-
King, V.1
Rao, S.2
Tarjan, R.3
|