{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:50:03Z","timestamp":1742914203219,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540339731"},{"type":"electronic","value":"9783540339748"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11749776_17","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T10:05:16Z","timestamp":1146132316000},"page":"195-206","source":"Crossref","is-referenced-by-count":1,"title":["A Distributed Preflow-Push for the Maximum Flow Problem"],"prefix":"10.1007","author":[{"given":"Thuy Lien","family":"Pham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Bui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Lavallee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Si Hoang","family":"Do","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Goldberg, A.V.: Recent Developments in Maximum Flow Algorithms. Technical Report (April 1998)","key":"17_CR1","DOI":"10.1007\/BFb0054350"},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A New Approach to the Maximum Flow Problem. Journal of ACM\u00a035(4), 921\u2013940 (1988)","journal-title":"Journal of ACM"},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/0022-0000(85)90039-X","volume":"31","author":"H.N. Gabow","year":"1985","unstructured":"Gabow, H.N.: Scaling Algorithms for Network Problems. Journal of Computer and System Sciences\u00a031(2), 148\u2013168 (1985)","journal-title":"Journal of Computer and System Sciences"},{"issue":"5","key":"17_CR4","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"A.V. Goldberg","year":"1998","unstructured":"Goldberg, A.V., Rao, S.: Beyond the Flow Decomposition Barrier. Journal of ACM\u00a045(5), 783\u2013797 (1998)","journal-title":"Journal of ACM"},{"key":"17_CR5","volume-title":"Flows in networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in networks. Princeton University Press, Princeton (1962)"},{"key":"17_CR6","volume-title":"Network Flows \u2013 Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows \u2013 Theory, Algorithms and Applications. Prentice-Hall, Inc., USA (1993)"},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Journal of ACM\u00a019(2), 248\u2013264 (1972)","journal-title":"Journal of ACM"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"Dinic","year":"1972","unstructured":"Dinic: Algorithm for Solution of a Problem in Networks with Power Estimation. Journal of ACM\u00a019, 248\u2013264 (1972)","journal-title":"Journal of ACM"},{"key":"17_CR9","first-page":"434","volume":"15","author":"Karzanov","year":"1974","unstructured":"Karzanov: Determining the Maximum Flow in a Network by the Method of Preflows. Soviet Mathematics Doklady\u00a015, 434\u2013437 (1974)","journal-title":"Soviet Mathematics Doklady"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0020-0190(99)00019-8","volume":"69","author":"J. Cheriyan","year":"1999","unstructured":"Cheriyan, J., Mehlhorn, K.: An analysis of the highest-level selection rule in the preflow-push max-flow algorithm. Information Processing Letters\u00a069, 239\u2013242 (1999)","journal-title":"Information Processing Letters"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/PL00009180","volume":"19","author":"B.V. Cherkassky","year":"1997","unstructured":"Cherkassky, B.V., Goldberg, A.V.: On Implementing Push-Relabel Method for the Maximum Flow Problem. Algorithmica\u00a019, 390\u2013410 (1997)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Anderson, R.J., Setubal, J.C.: On the Parallel Implementation of Goldberg\u2019s Maximum Flow Algorithm. In: Proc. of the 4th Annual ACM Symp. on Parallel Algorithms and Architectures, pp. 168\u2013177 (1992)","key":"17_CR12","DOI":"10.1145\/140901.140919"},{"key":"17_CR13","first-page":"200","volume-title":"An introduction to distributed algorithms, ch. 7","author":"V.C. Barbosa","year":"1996","unstructured":"Barbosa, V.C.: An introduction to distributed algorithms, ch. 7, pp. 200\u2013216. The MIT Press, Cambridge (1996)"},{"unstructured":"Takkula, T.: A preflow-push algorithm that handles online max flow problems in a static asynchronous network (Revision 1.18). Chalmers University of Technology, Gothenbourg, Sweden (2001)","key":"17_CR14"},{"unstructured":"Nagy, N., Akl, S.G.: The Maximum Flow Problem: A Real-Time Approach. Technical Report, Dept. of Computing and Information Sciences Queen\u2019s Univ., Canada (2001)","key":"17_CR15"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R. Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.-Y.R., Yeung, R.W.: Network information flow. IEEE Trans. on Information Theory\u00a046, 1204\u20131216 (2000)","journal-title":"IEEE Trans. on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Innovative Internet Community Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11749776_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:35:36Z","timestamp":1558272936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11749776_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540339731","9783540339748"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11749776_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}