{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:41:27Z","timestamp":1729658487445,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/rivf.2006.1696436","type":"proceedings-article","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T13:01:13Z","timestamp":1158930073000},"page":"187-194","source":"Crossref","is-referenced-by-count":4,"title":["An adaptive distributed algorithm for the maximum flow problem in the underlying asynchronous network"],"prefix":"10.1109","author":[{"family":"Thuy Lien Pham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Bui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Lavallee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Si Hoang Do","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","first-page":"200","author":"barbosa","year":"1996","journal-title":"An Introduction to Distributed Algorithms"},{"year":"0","key":"22"},{"journal-title":"The LEDA Platform of Combinatorial and Geometric Computing","year":"1999","author":"mehlhom","key":"17"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791278376"},{"year":"0","key":"15"},{"journal-title":"On the Parallel Implementation of Goldberg's Maximum Flow Algorithm Proc of the 4th Annual ACM Symp on Parallel Algorithms and Architectures pages 168-177 1992","year":"0","author":"anderson","key":"16"},{"key":"13","first-page":"3","article-title":"Systematic Building of a distributed recurive algorithm, example the shortest path algorithm","volume":"1","author":"ivan","year":"1995","journal-title":"Acta Mathematica Vie?tnamica"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1044"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791221529"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00019-8"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(03)00022-X"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"journal-title":"A preflow-push algorithm that handles online max flow problems in a static asynchronous network (Revision 1 18)","year":"2001","author":"takkula","key":"20"},{"key":"2","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0054350","article-title":"Recent Developments in Maximum Flow Algorithms","author":"goldberg","year":"1998"},{"year":"0","key":"1"},{"key":"10","first-page":"434","article-title":"Determining the Maximum Flow in a Network by the Method of Preflows","volume":"15","author":"karzanov","year":"1974","journal-title":"Soviet Mathematics Doklady"},{"journal-title":"Network Flows - Theory Algorithms and Applications","year":"1993","author":"ahuja","key":"7"},{"journal-title":"Flows in Networks","year":"1962","author":"ford","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290181"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90039-X"},{"key":"9","first-page":"248","article-title":"Algorithm for Solution of a Problem in Networks with Power Estimation","volume":"19","author":"dinic","year":"1972","journal-title":"Journal of ACM"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"}],"event":{"name":"2006 International Conference onResearch, Innovation and Vision for the Future","location":"Ho Chi Minh City, Vietnam"},"container-title":["2006 International Conference onResearch, Innovation and Vision for the Future"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/11098\/35468\/01696436.pdf?arnumber=1696436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T05:30:03Z","timestamp":1497677403000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1696436\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/rivf.2006.1696436","relation":{},"subject":[]}}