{"id":"https://openalex.org/W2028155031","doi":"https://doi.org/10.1002/net.3230150404","title":"Reducing complexities of the distributed max\u2010flow and breadth\u2010first\u2010search algorithms by means of network synchronization","display_name":"Reducing complexities of the distributed max\u2010flow and breadth\u2010first\u2010search algorithms by means of network synchronization","publication_year":1985,"publication_date":"1985-12-01","ids":{"openalex":"https://openalex.org/W2028155031","doi":"https://doi.org/10.1002/net.3230150404","mag":"2028155031"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230150404","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230150404","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110260801","display_name":"Baruch Awerbuch","orcid":null},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["IL","US"],"is_corresponding":true,"raw_author_name":"Baruch Awerbuch","raw_affiliation_strings":["Computer Science Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139","The author is supported by Weizmann Fellowship"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"The author is supported by Weizmann Fellowship","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110260801"],"corresponding_institution_ids":["https://openalex.org/I53964585","https://openalex.org/I63966007"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.1335,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.8785124,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"15","issue":"4","first_page":"425","last_page":"437"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.8249906301498413},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7716356515884399},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.6718646883964539},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.658977746963501},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5968377590179443},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.576465368270874},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5266175866127014},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5029167532920837},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.47984835505485535},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.47133946418762207},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.45043161511421204},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4279884696006775},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.42654621601104736},{"id":"https://openalex.org/keywords/telecommunications-network","display_name":"Telecommunications network","score":0.4257773160934448},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.329267680644989},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32240015268325806},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.2947204113006592},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18808546662330627},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.16968917846679688},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10265380144119263}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.8249906301498413},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7716356515884399},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.6718646883964539},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.658977746963501},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5968377590179443},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.576465368270874},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5266175866127014},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5029167532920837},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.47984835505485535},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.47133946418762207},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.45043161511421204},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4279884696006775},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.42654621601104736},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.4257773160934448},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.329267680644989},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32240015268325806},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2947204113006592},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18808546662330627},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.16968917846679688},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10265380144119263},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230150404","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230150404","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W57138151","https://openalex.org/W1498585861","https://openalex.org/W2007113317","https://openalex.org/W2007470648","https://openalex.org/W2092534058","https://openalex.org/W2150519657","https://openalex.org/W2170720733"],"related_works":["https://openalex.org/W3098335909","https://openalex.org/W2008046591","https://openalex.org/W2037710955","https://openalex.org/W1981706003","https://openalex.org/W2049713017","https://openalex.org/W2007113317","https://openalex.org/W1990389251","https://openalex.org/W2084577435","https://openalex.org/W2146073828","https://openalex.org/W2055655252"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"article":[2],"presents":[3],"new":[4],"simple":[5],"distributed":[6],"Maximum":[7],"Flow":[8],"and":[9,29,41],"Breadth\u2010First":[10],"Search":[11],"algorithms":[12,19,24,46],"for":[13],"an":[14],"asynchronous":[15],"communication":[16,28],"network.":[17],"Our":[18],"improve":[20],"the":[21,27,39,50,53],"best":[22],"known":[23],"both":[25],"in":[26],"time":[30],"complexities.":[31],"The":[32],"basic":[33],"idea":[34],"is":[35],"first":[36],"to":[37,43],"\u201csynchronize\u201d":[38],"network":[40],"then":[42],"apply":[44],"synchronous":[45],"which":[47],"use":[48],"efficiently":[49],"parallelism":[51],"of":[52],"model.":[54]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}