{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:13:34Z","timestamp":1757542414900},"reference-count":9,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7619,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1985,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This article presents new simple distributed Maximum Flow and Breadth\u2010First Search algorithms for an asynchronous communication network. Our algorithms improve the best known algorithms both in the communication and time complexities. The basic idea is first to \u201csynchronize\u201d the network and then to apply synchronous algorithms which use efficiently the parallelism of the model.<\/jats:p>","DOI":"10.1002\/net.3230150404","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T16:18:08Z","timestamp":1178900288000},"page":"425-437","source":"Crossref","is-referenced-by-count":35,"title":["Reducing complexities of the distributed max\u2010flow and breadth\u2010first\u2010search algorithms by means of network synchronization"],"prefix":"10.1002","volume":"15","author":[{"given":"Baruch","family":"Awerbuch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"B.Awerbuch Complexity of Network Synchronization Journal of the ACM October1985.","DOI":"10.1145\/4221.4227"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1983.234958"},{"key":"e_1_2_1_4_2","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in a network with power estimation","volume":"11","author":"Dinic E. A.","year":"1970","journal-title":"Soviet Math. Dokl."},{"volume-title":"Graph Algorithms","year":"1979","author":"Even S.","key":"e_1_2_1_5_2"},{"key":"e_1_2_1_6_2","unstructured":"D.Eckstein Parallel processing using depth\u2010search and breadth\u2010first search. Ph. D. Thesis University of Iowa Iowa City 1977."},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"R. G.Gallager Distributed minimum hop algorithms. M. I. T. Technical Report LIDS\u2010P\u20101175 Cambridge MA January1982.","DOI":"10.21236\/ADA117808"},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","DOI":"10.1109\/TCOM.1980.1094721","article-title":"The new routing algorithm for the ARPANET","volume":"28","author":"McQuillan J. M.","year":"1980","journal-title":"IEEE Trans. Comm."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120302"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90013-X"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230150404","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230150404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T16:06:36Z","timestamp":1697817996000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230150404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["10.1002\/net.3230150404"],"URL":"https:\/\/doi.org\/10.1002\/net.3230150404","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"type":"print","value":"0028-3045"},{"type":"electronic","value":"1097-0037"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}