{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T10:25:22Z","timestamp":1649067922850},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,10,31]],"date-time":"2014-10-31T00:00:00Z","timestamp":1414713600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s11227-014-1314-7","type":"journal-article","created":{"date-parts":[[2014,10,30]],"date-time":"2014-10-30T13:08:09Z","timestamp":1414674489000},"page":"629-647","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Two-stage distributed parallel algorithm with message passing interface for maximum flow problem"],"prefix":"10.1007","volume":"71","author":[{"given":"Jincheng","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Lixin","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,31]]},"reference":[{"key":"1314_CR1","volume-title":"Network flows: theory, algorithms and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms and applications. Prentice-Hall, Englewood Cliffs"},{"issue":"29","key":"1314_CR2","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/S0167-8191(03)00022-X","volume":"6","author":"N Nagy","year":"2003","unstructured":"Nagy N, Akl SG (2003) The maximum flow problem: a real-time approach. Parallel Comput 6(29):767\u2013794","journal-title":"Parallel Comput"},{"key":"1314_CR3","first-page":"1277","volume":"11","author":"EA Dinic","year":"1970","unstructured":"Dinic EA (1970) Algorithm for the solution of a problem of maximal flow in networks with power estimation. Soviet Math Doklady 11:1277\u20131280","journal-title":"Soviet Math Doklady"},{"issue":"38","key":"1314_CR4","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/1520-6750(199106)38:3<413::AID-NAV3220380310>3.0.CO;2-J","volume":"3","author":"RK Ahuja","year":"1991","unstructured":"Ahuja RK, Orlin JB (1991) Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems. Nav Res Log 3(38):413\u2013430","journal-title":"Nav Res Log"},{"issue":"35","key":"1314_CR5","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"4","author":"AV Goldberg","year":"1988","unstructured":"Goldberg AV, Tarjan RE (1988) A new approach to the maximum flow problem. J ACM 4(35):921\u2013940","journal-title":"J ACM"},{"issue":"56","key":"1314_CR6","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.1080.0524","volume":"4","author":"DS Hochbaum","year":"2008","unstructured":"Hochbaum DS (2008) The pseudoflow algorithm: a new algorithm for the maximum-flow problem. Oper Res 4(56):992\u20131009","journal-title":"Oper Res"},{"issue":"26","key":"1314_CR7","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"9","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 Trans Pattern Anal 9(26):1124\u20131137","journal-title":"IEEE Trans Pattern Anal"},{"key":"1314_CR8","doi-asserted-by":"crossref","unstructured":"Dong JY, Li W, Cai CB, Chen Z (2009) Draining algorithm for the maximum flow problem, 2009 WRI International Conference on Communications And Mobile Computing: CMC 2009, Washington DC, IEEE Computer Society, vol 3, pp 197\u2013200","DOI":"10.1109\/CMC.2009.222"},{"key":"1314_CR9","unstructured":"Goldberg AV (2008) The partial augment-relabel algorithm for the maximum flow problem. In: Proceedings 16th annual European symposium. Algorithms-Esa 2008, pp 466\u2013477"},{"issue":"43","key":"1314_CR10","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0453-4514(00)88749-9","volume":"1","author":"T Asano","year":"2000","unstructured":"Asano T, Asano Y (2000) Recent developments in maximum flow algorithms. J Oper Res Soc Jpn 1(43):2\u201331","journal-title":"J Oper Res Soc Jpn"},{"issue":"3","key":"1314_CR11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"1","author":"Y Shiloach","year":"1982","unstructured":"Shiloach Y, Vishkin U (1982) An O(Logn) parallel connectivity algorithm. J Algorithm 1(3):57\u201367","journal-title":"J Algorithm"},{"issue":"34","key":"1314_CR12","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1145\/31846.31849","volume":"4","author":"DB Johnson","year":"1987","unstructured":"Johnson DB (1987) Parallel algorithms for minimum cuts and maximum flows in planar networks. J ACM 4(34):950\u2013967","journal-title":"J ACM"},{"key":"1314_CR13","volume-title":"An introduction to distributed algorithms","author":"VC Barbosa","year":"1996","unstructured":"Barbosa VC (1996) An introduction to distributed algorithms. MIT Press, Cambridge"},{"key":"1314_CR14","unstructured":"David AB, Vipin S (2005) A cache-aware parallel implementation of the push-relabel network flow algorithm and experimental evaluation of the gap relabeling heuristic. In: Proceeding of 18th ISCA international conference on parallel and distributed computing systems. Las Vegas, NV, pp 41\u201348"},{"issue":"22","key":"1314_CR15","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1109\/TPDS.2010.156","volume":"6","author":"B Hong","year":"2011","unstructured":"Hong B, He ZY (2011) An asynchronous multithreaded algorithm for the maximum network flow problem with nonblocking global relabeling heuristic. IEEE Trans Parallel Distr 6(22):1025\u20131033","journal-title":"IEEE Trans Parallel Distr"},{"issue":"58","key":"1314_CR16","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s11227-009-0360-z","volume":"2","author":"P Alonso","year":"2011","unstructured":"Alonso P, Cortina R, Martinez-Zaldivar FJ, Ranilla J (2011) Neville elimination on multi- and many-core systems: OpenMP. MPI CUDA J Supercomput 2(58):215\u2013225","journal-title":"MPI CUDA J Supercomput"},{"key":"1314_CR17","doi-asserted-by":"crossref","unstructured":"Vineet V, Narayanan PJ (2008) CUDA cuts: fast graph cuts on the GPU. In: 2008 IEEE computer society conference on computer vision and pattern recognition workshops, Anchorage, vols 1\u20133, pp 1070\u20131077","DOI":"10.1109\/CVPRW.2008.4563095"},{"key":"1314_CR18","unstructured":"He Z, Hong B (2010) Dynamically tuned push-relabel algorithm for the maximum flow problem on cpu-gpu-hybrid platforms. In: IEEE international symposium on parallel and distributed processing, Atlanta, pp 19\u201323"},{"issue":"64","key":"1314_CR19","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1007\/s11227-011-0672-7","volume":"3","author":"LH Jian","year":"2013","unstructured":"Jian LH, Wang C, Liu Y, Liang SS, Yi WD, Shi Y (2013) Parallel data mining techniques on Graphics Processing Unit with Compute Unified Device Architecture (CUDA). J Supercomput 3(64):942\u2013967","journal-title":"J Supercomput"},{"issue":"11","key":"1314_CR20","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1007912007767","volume":"2","author":"SY Park","year":"1997","unstructured":"Park SY, Hariri S (1997) A high performance message-passing system for network of workstations. J Supercomput 2(11):159\u2013179","journal-title":"J Supercomput"},{"key":"1314_CR21","doi-asserted-by":"crossref","unstructured":"Delong A, Boykov Y (2008) A scalable graph-cut algorithm for N\u2013D grids. In: IEEE conference on computer vision and pattern recognition, Anchorage, pp 946\u2013953","DOI":"10.1109\/CVPR.2008.4587464"},{"issue":"104","key":"1314_CR22","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s11263-012-0571-2","volume":"3","author":"A Shekhovtsov","year":"2013","unstructured":"Shekhovtsov A, Hlavac V (2013) A distributed mincut\/maxflow algorithm combining path augmentation and push-relabel. Int J Comput Vis 3(104):315\u2013342","journal-title":"Int J Comput Vis"},{"key":"1314_CR23","doi-asserted-by":"crossref","unstructured":"Eleyat M, Haugland D, Hetland ML, Natvig L (2012) Parallel algorithms for the maximum flow problem with minimum lot sizes. In: Klatte D, L\u00fcthi hj, Karl S (eds) Operations research proceedings 2011. Selected papers of the international conference on operations research (OR 2011), August 30-September 2, 2011, Zurich, Switzerland, Springer, Berlin, Heidelberg, pp 83\u201388","DOI":"10.1007\/978-3-642-29210-1_14"},{"issue":"19","key":"1314_CR24","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/PL00009180","volume":"4","author":"BV Cherkassky","year":"1997","unstructured":"Cherkassky BV, Goldberg AV (1997) On implementing the push-relabel method for the maximum flow problem. Algorithmica 4(19):390\u2013410","journal-title":"Algorithmica"},{"issue":"14","key":"1314_CR25","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1002\/cpe.605","volume":"3","author":"K Schloegel","year":"2002","unstructured":"Schloegel K, Karypis G, Kumar V (2002) Parallel static and dynamic multi-constraint graph partitioning. Concurr Comput Pract E 3(14):219\u2013240","journal-title":"Concurr Comput Pract E"},{"issue":"97","key":"1314_CR26","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0377-2217(96)00269-X","volume":"3","author":"RK Ahuja","year":"1997","unstructured":"Ahuja RK, Kodialam M, Mishra AK, Orlin JB (1997) Computational investigations of maximum flow algorithms. Eur J Oper Res 3(97):509\u2013542","journal-title":"Eur J Oper Res"},{"key":"1314_CR27","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH (2009) Introduction to Algorithms. MIT Press, Cambridge"},{"key":"1314_CR28","volume-title":"Network flows and matching: first DIMACS implementation challenge, DIMACS series in discrete mathematics and theoretical computer science","author":"T Badics","year":"1993","unstructured":"Badics T, Boros E, Cepek O (1993) Implementing a new maximum flow algorithm. In: Johnson DS, McGeoch CC (eds) Network flows and matching: first DIMACS implementation challenge, DIMACS series in discrete mathematics and theoretical computer science, vol 12. American Mathematical Society, Providence"},{"key":"1314_CR29","doi-asserted-by":"crossref","unstructured":"Strandmark P, Kahl F (2010) Parallel and distributed graph cuts by dual decomposition. In: 2010 IEEE conference on computer vision and pattern recognition (CVPR), San Francisco, pp 2085\u20132092","DOI":"10.1109\/CVPR.2010.5539886"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1314-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-014-1314-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1314-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T20:52:11Z","timestamp":1565988731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-014-1314-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,31]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["1314"],"URL":"https:\/\/doi.org\/10.1007\/s11227-014-1314-7","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,31]]}}}