{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T11:39:22Z","timestamp":1762429162877},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,9,22]],"date-time":"2012-09-22T00:00:00Z","timestamp":1348272000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Comput Vis"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s11263-012-0571-2","type":"journal-article","created":{"date-parts":[[2012,9,21]],"date-time":"2012-09-21T16:58:55Z","timestamp":1348246735000},"page":"315-342","source":"Crossref","is-referenced-by-count":20,"title":["A Distributed Mincut\/Maxflow Algorithm Combining Path Augmentation and Push-Relabel"],"prefix":"10.1007","volume":"104","author":[{"given":"Alexander","family":"Shekhovtsov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00e1clav","family":"Hlav\u00e1\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,22]]},"reference":[{"issue":"1","key":"571_CR1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1006\/jpdc.1995.1103","volume":"29","author":"R. Anderson","year":"1995","unstructured":"Anderson, R., & Setubal, J. C. (1995). A parallel implementation of the push-relabel algorithm for the maximum flow problem. Journal of Parallel Distributed Computing, 29(1), 17\u201326.","journal-title":"Journal of Parallel Distributed Computing"},{"key":"571_CR2","unstructured":"Boros, E., Hammer, P. L., & Sun, X. (1991). Network flows and minimization of quadratic pseudo-Boolean functions. Tech. rep. RRR 17-1991, RUTCOR."},{"issue":"2","key":"571_CR3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s11263-006-7934-5","volume":"70","author":"Y. Boykov","year":"2006","unstructured":"Boykov, Y., & Funka-Lea, G. (2006). Graph cuts and efficient N-D image segmentation. International Journal of Computer Vision, 70(2), 109\u2013137.","journal-title":"International Journal of Computer Vision"},{"key":"571_CR4","volume-title":"ICCV","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., & Jolly, M. P. (2001). Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images. In ICCV."},{"key":"571_CR5","volume-title":"ICCV","author":"Y. Boykov","year":"2003","unstructured":"Boykov, Y., & Kolmogorov, V. (2003). Computing geodesics and minimal surfaces via graph cuts. In ICCV."},{"issue":"9","key":"571_CR6","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"26","author":"Y. Boykov","year":"2004","unstructured":"Boykov, Y., & Kolmogorov, V. (2004). 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\u20131137.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"571_CR7","volume-title":"BMVC","author":"Y. Boykov","year":"2006","unstructured":"Boykov, Y., & Lempitsky, V. (2006). From photohulls to photoflux optimization. In BMVC."},{"key":"571_CR8","volume-title":"CVPR","author":"Y. Boykov","year":"1998","unstructured":"Boykov, Y., Veksler, O., & Zabih, R. (1998). Markov random fields with efficient approximations. In CVPR."},{"key":"571_CR9","volume-title":"ICCV","author":"Y. Boykov","year":"1999","unstructured":"Boykov, Y., Veksler, O., & Zabih, R. (1999). Fast approximate energy minimization via graph cuts. In ICCV."},{"key":"571_CR10","unstructured":"Cherkassky, B. V., & Goldberg, A. V. (1994). On implementing push-relabel method for the maximum flow problem. Tech. rep."},{"key":"571_CR11","volume-title":"CVPR","author":"A. Delong","year":"2008","unstructured":"Delong, A., & Boykov, Y. (2008). A scalable graph-cut algorithm for N-D grids. In CVPR."},{"key":"571_CR12","unstructured":"Goldberg, A. (1987). Efficient graph algorithms for sequential and parallel computers. Ph.D. thesis, Massachusetts Institute of Technology."},{"issue":"4","key":"571_CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0020-0190(91)90097-2","volume":"38","author":"A. V. Goldberg","year":"1991","unstructured":"Goldberg, A. V. (1991). Processor-efficient implementation of a maximum flow algorithm. Information Processing Letters, 38(4), 179\u2013185.","journal-title":"Information Processing Letters"},{"key":"571_CR14","volume-title":"Proceedings of the 16th annual European symposium on algorithms","author":"A. V. Goldberg","year":"2008","unstructured":"Goldberg, A. V. (2008). The partial augment\u2013relabel algorithm for the maximum flow problem. In Proceedings of the 16th annual European symposium on algorithms."},{"key":"571_CR15","doi-asserted-by":"crossref","unstructured":"Goldberg, A. V., & Rao, S. (1998). Beyond the flow decomposition barrier. J. ACM.","DOI":"10.1145\/290179.290181"},{"key":"571_CR16","doi-asserted-by":"crossref","unstructured":"Goldberg, A. V., & Tarjan, R. E. (1988). A new approach to the maximum flow problem. Journal of the ACM, 35.","DOI":"10.1145\/48014.61051"},{"issue":"10","key":"571_CR17","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1109\/TPAMI.2003.1233908","volume":"25","author":"H. Ishikawa","year":"2003","unstructured":"Ishikawa, H. (2003). Exact optimization for Markov random fields with convex priors. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(10), 1333\u20131336.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"571_CR18","volume-title":"CVPR","author":"M. Jancosek","year":"2011","unstructured":"Jancosek, M., & Pajdla, T. (2011). Robust, accurate and weakly-supported-surfaces preserving multi-vew reconstruction. In CVPR."},{"key":"571_CR19","first-page":"922","volume-title":"ICCV05","author":"P. Kohli","year":"2005","unstructured":"Kohli, P., & Torr, P. (2005). Efficiently solving dynamic Markov random fields using graph cuts. In ICCV05 (Vol.\u00a02, pp. 922\u2013929)."},{"key":"571_CR20","volume-title":"ICML","author":"P. Kohli","year":"2008","unstructured":"Kohli, P., Shekhovtsov, A., Rother, C., Kolmogorov, V., & Torr, P. (2008). On partial optimality in multi-label MRFs. In ICML."},{"key":"571_CR21","unstructured":"Kolmogorov, V. (2004). Graph based algorithms for scene reconstruction from two or more views. Ph.D. thesis, Ithaca, NY, USA, aAI3114475."},{"issue":"7","key":"571_CR22","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1109\/TPAMI.2007.1031","volume":"29","author":"V. Kolmogorov","year":"2007","unstructured":"Kolmogorov, V., & Rother, C. (2007). Minimizing non-submodular functions with graph cuts\u2014a review. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(7), 1274\u20131279.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"571_CR23","volume-title":"ICCV","author":"V. Kolmogorov","year":"2001","unstructured":"Kolmogorov, V., & Zabih, R. (2001). Computing visual correspondence with occlusions via graph cuts. In ICCV."},{"key":"571_CR24","unstructured":"Kovtun, I. (2004). Image segmentation based on sufficient conditions of optimality in np-complete classes of structural labelling problem. Ph.D. thesis (in Ukrainian)."},{"issue":"8","key":"571_CR25","doi-asserted-by":"crossref","first-page":"2275","DOI":"10.1111\/j.1467-8659.2009.01530.x","volume":"28","author":"P. Labatut","year":"2009","unstructured":"Labatut, P., Pons, J. P., & Keriven, R. (2009). Robust and efficient surface reconstruction from range data. Computer Graphics Forum, 28(8), 2275\u20132290.","journal-title":"Computer Graphics Forum"},{"key":"571_CR26","volume-title":"CVPR","author":"V. Lempitsky","year":"2007","unstructured":"Lempitsky, V., & Boykov, Y. (2007). Global optimization for shape fitting. In CVPR."},{"key":"571_CR27","volume-title":"ECCV","author":"V. Lempitsky","year":"2006","unstructured":"Lempitsky, V., Boykov, Y., Ivanov, D., & Ivanov, D. (2006). Oriented visibility for multiview reconstruction. In ECCV."},{"issue":"8","key":"571_CR28","doi-asserted-by":"crossref","first-page":"1392","DOI":"10.1109\/TPAMI.2009.143","volume":"32","author":"V. Lempitsky","year":"2010","unstructured":"Lempitsky, V., Rother, C., Roth, S., & Blake, A. (2010). Fusion moves for Markov random field optimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(8), 1392\u20131405.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"571_CR29","volume-title":"CVPR","author":"J. Liu","year":"2010","unstructured":"Liu, J., & Sun, J. (2010). Parallel graph-cuts by adaptive bottom-up merging. In CVPR."},{"key":"571_CR30","unstructured":"Schlesinger, D., & Flach, B. (2006). Transforming an arbitrary minsum problem into a binary one. Research report, Dresden University of Technology."},{"key":"571_CR31","series-title":"Lecture notes in computer science","first-page":"14","volume-title":"Proceedings of the 8th international conference on energy minimization methods in computer vision and pattern recognition (EMMCVPR)","author":"A. Shekhovtsov","year":"2011","unstructured":"Shekhovtsov, A., & Hlavac, V. (2011). A distributed mincut\/maxflow algorithm combining path augmentation and push-relabel. In Lecture notes in computer science. Proceedings of the 8th international conference on energy minimization methods in computer vision and pattern recognition (EMMCVPR) (p.\u00a014). Berlin: Springer."},{"key":"571_CR32","doi-asserted-by":"crossref","unstructured":"Strandmark, P., & Kahl, F. (2010). Parallel and distributed graph cuts by dual decomposition. In CVPR.","DOI":"10.1109\/CVPR.2010.5539886"},{"key":"571_CR33","unstructured":"University of Western Ontario web pages (2008). Computer vision research group. max-flow problem instances in vision. http:\/\/vision.csd.uwo.ca\/maxflow-data\/ ."}],"container-title":["International Journal of Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-012-0571-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11263-012-0571-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-012-0571-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T02:37:46Z","timestamp":1594694266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11263-012-0571-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,22]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["571"],"URL":"https:\/\/doi.org\/10.1007\/s11263-012-0571-2","relation":{},"ISSN":["0920-5691","1573-1405"],"issn-type":[{"value":"0920-5691","type":"print"},{"value":"1573-1405","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,22]]}}}