{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:14:20Z","timestamp":1726406060169},"reference-count":19,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":8806,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1982,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This article presents three protocols for obtaining maximum flow in a network by using distributed computation. Each node in the network has memory and processing capabilities and coordinates the algorithm with its neighbors by means of control messages. In the order presented, each protocol employs less communication than the previous one, but requires more time and node computation.<\/jats:p>","DOI":"10.1002\/net.3230120302","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T13:25:49Z","timestamp":1178889949000},"page":"213-230","source":"Crossref","is-referenced-by-count":12,"title":["Decentralized maximum\u2010flow protocols"],"prefix":"10.1002","volume":"12","author":[{"given":"Adrian","family":"Segall","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":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"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":"Sov. Math. Dokl."},{"key":"e_1_2_1_5_2","first-page":"434","article-title":"Determining the maximal flow in a network by the method of preflows","volume":"15","author":"Karzanov A. V.","year":"1974","journal-title":"Sov. Math. Dokl."},{"key":"e_1_2_1_6_2","unstructured":"V. M.Malhotra M.Pramodh Kumar andS. N.Mahashwari AnO(|N|3) algorithm for finding maximum flows in networks. Unpublished."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093711"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094274"},{"key":"e_1_2_1_9_2","unstructured":"A.Segall P. M.Merlin andR. G.Gallager A recoverable protocol for loop\u2010free distributed routing.Intern. Conf. Comm. 78 Toronto 1978."},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094552"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1981.1095017"},{"volume-title":"A Shortest path routing algorithm with automatic resync","year":"1976","author":"Gallager R. G.","key":"e_1_2_1_12_2"},{"key":"e_1_2_1_13_2","doi-asserted-by":"crossref","unstructured":"P. A.Humblet A distributed shortest\u2010path algorithm. International Telemetering Conference Los Angeles 1978.","DOI":"10.21236\/ADA059838"},{"key":"e_1_2_1_14_2","unstructured":"Y.Dalal Broadcast Protocols in Packet Switched Computer Networks. Ph.D. Thesis Stanford Univ. 1977."},{"key":"e_1_2_1_15_2","unstructured":"P. M.Spira Communication complexity of distributed minimum spanning tree algorithms. Second Berkeley Workshop on Distributed Data Management and Computer Networks 1977."},{"volume-title":"Minimum Weight Spanning Trees","year":"1978","author":"Gallager R. G.","key":"e_1_2_1_16_2"},{"key":"e_1_2_1_17_2","doi-asserted-by":"crossref","unstructured":"R.Lau R. M.Persiano andP.Varaiya Decentralized information and control: A network flow example.IEEE Trans. Automatic Control.AC\u201017 (1972)466\u2013474.","DOI":"10.1109\/TAC.1972.1100036"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1978.11141"},{"key":"e_1_2_1_19_2","doi-asserted-by":"crossref","unstructured":"A.Segall Distributed Network Protocols. IEEE Trans. Infor. Theory.To appear. See also LIDS Report LIDS\u2010P\u20101014 MIT 1980.","DOI":"10.21236\/ADA087623"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1980.1094721"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230120302","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230120302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T13:19:30Z","timestamp":1699795170000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230120302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["10.1002\/net.3230120302"],"URL":"https:\/\/doi.org\/10.1002\/net.3230120302","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"type":"print","value":"0028-3045"},{"type":"electronic","value":"1097-0037"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}