{"id":"https://openalex.org/W2157964659","doi":"https://doi.org/10.1109/rivf.2006.1696436","title":"An adaptive distributed algorithm for the maximum flow problem in the underlying asynchronous network","display_name":"An adaptive distributed algorithm for the maximum flow problem in the underlying asynchronous network","publication_year":2006,"publication_date":"2006-09-22","ids":{"openalex":"https://openalex.org/W2157964659","doi":"https://doi.org/10.1109/rivf.2006.1696436","mag":"2157964659"},"language":"en","primary_location":{"id":"doi:10.1109/rivf.2006.1696436","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2006.1696436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 International Conference onResearch, Innovation and Vision for the Future","raw_type":"proceedings-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/A5075172399","display_name":"Thuy Lien Pham","orcid":null},"institutions":[{"id":"https://openalex.org/I4210127056","display_name":"Laboratoire Mati\u00e8re et Syst\u00e8mes Complexes","ror":"https://ror.org/032w6q449","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210095849","https://openalex.org/I4210127056"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Thuy Lien Pham","raw_affiliation_strings":["Laboratoire d'Informatique et des Syst\u00e9mes Complexes, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique et des Syst\u00e9mes Complexes, Paris, France","institution_ids":["https://openalex.org/I4210127056"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000345435","display_name":"Minh N. B\u00f9i","orcid":"https://orcid.org/0000-0003-2910-667X"},"institutions":[{"id":"https://openalex.org/I4210127056","display_name":"Laboratoire Mati\u00e8re et Syst\u00e8mes Complexes","ror":"https://ror.org/032w6q449","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210095849","https://openalex.org/I4210127056"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"M. Bui","raw_affiliation_strings":["Laboratoire d'Informatique et des Syst\u00e9mes Complexes, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique et des Syst\u00e9mes Complexes, Paris, France","institution_ids":["https://openalex.org/I4210127056"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067081605","display_name":"Ivan Lavall\u00e9e","orcid":null},"institutions":[{"id":"https://openalex.org/I4210127056","display_name":"Laboratoire Mati\u00e8re et Syst\u00e8mes Complexes","ror":"https://ror.org/032w6q449","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210095849","https://openalex.org/I4210127056"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"I. Lavallee","raw_affiliation_strings":["Laboratoire d'Informatique et des Syst\u00e9mes Complexes, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique et des Syst\u00e9mes Complexes, Paris, France","institution_ids":["https://openalex.org/I4210127056"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029392328","display_name":"Si Hoang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210127056","display_name":"Laboratoire Mati\u00e8re et Syst\u00e8mes Complexes","ror":"https://ror.org/032w6q449","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210095849","https://openalex.org/I4210127056"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Si Hoang Do","raw_affiliation_strings":["Laboratoire d'Informatique et des Syst\u00e9mes Complexes, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique et des Syst\u00e9mes Complexes, Paris, France","institution_ids":["https://openalex.org/I4210127056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.21548073,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"1","issue":null,"first_page":"187","last_page":"194"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998000264167786,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8100378513336182},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7490260601043701},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.7059364914894104},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5741212368011475},{"id":"https://openalex.org/keywords/sink","display_name":"Sink (geography)","score":0.5411869883537292},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5363890528678894},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4881935715675354},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.47612980008125305},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4179953932762146},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34605318307876587},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2840891182422638},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1307634711265564},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11559215188026428}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8100378513336182},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7490260601043701},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.7059364914894104},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5741212368011475},{"id":"https://openalex.org/C143050476","wikidata":"https://www.wikidata.org/wiki/Q194502","display_name":"Sink (geography)","level":2,"score":0.5411869883537292},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5363890528678894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4881935715675354},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.47612980008125305},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4179953932762146},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34605318307876587},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2840891182422638},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1307634711265564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11559215188026428},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rivf.2006.1696436","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2006.1696436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 International Conference onResearch, Innovation and Vision for the Future","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W75740688","https://openalex.org/W1485262373","https://openalex.org/W1804861372","https://openalex.org/W1964119857","https://openalex.org/W1977545325","https://openalex.org/W1992170089","https://openalex.org/W2002741701","https://openalex.org/W2019783787","https://openalex.org/W2080488179","https://openalex.org/W2090359754","https://openalex.org/W2099463627","https://openalex.org/W2102516175","https://openalex.org/W2105831729","https://openalex.org/W2136604606","https://openalex.org/W2139559590","https://openalex.org/W2145532166","https://openalex.org/W2149342630","https://openalex.org/W2152216760","https://openalex.org/W2162493032","https://openalex.org/W2478362353","https://openalex.org/W4210777595","https://openalex.org/W4213060235"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W2098682899","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2766289720","https://openalex.org/W2610002854","https://openalex.org/W3141113327"],"abstract_inverted_index":{"This":[0,52],"paper":[1],"presents":[2],"a":[3,14,72],"new":[4],"adaptive":[5],"distributed":[6],"algorithm":[7,53,81],"which":[8],"solves":[9],"the":[10,18,25,37,50,57,80],"problem":[11],"of":[12,46,59,74],"finding":[13],"maximum":[15],"flow":[16],"in":[17,49],"underlying":[19],"asynchronous":[20],"network.":[21,51],"Sequential":[22],"processes,":[23],"executing":[24],"same":[26],"code":[27],"over":[28],"local":[29],"data,":[30],"exchange":[31],"messages":[32],"with":[33],"neighbors":[34],"to":[35,43,56],"establish":[36],"max":[38],"flow,":[39],"and":[40,77,88],"adapt":[41],"themselves":[42],"any":[44],"change":[45],"arc":[47],"capacity":[48],"is":[54],"derived":[55],"case":[58],"multiple":[60],"sources":[61],"and/or":[62,68],"sinks":[63],"without":[64],"adding":[65],"virtual":[66,69],"source":[67],"sink.":[70],"For":[71],"graph":[73],"V":[75],"nodes":[76],"E":[78],"arcs,":[79],"achieves":[82],"O(n":[83,89],"2":[84,90],"m)":[85],"message":[86],"complexity":[87],")":[91],"time":[92],"complexity.":[93]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}