{"id":"https://openalex.org/W1968084791","doi":"https://doi.org/10.1287/opre.40.5.923","title":"An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs","display_name":"An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs","publication_year":1992,"publication_date":"1992-10-01","ids":{"openalex":"https://openalex.org/W1968084791","doi":"https://doi.org/10.1287/opre.40.5.923","mag":"1968084791"},"language":"en","primary_location":{"id":"doi:10.1287/opre.40.5.923","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.40.5.923","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","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/A5085640376","display_name":"Dorit S. Hochbaum","orcid":"https://orcid.org/0000-0002-2498-0512"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dorit S. Hochbaum","raw_affiliation_strings":["University of California, Berkeley, California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, California","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5085640376"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.4782,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.59101854,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"40","issue":"5","first_page":"923","last_page":"935"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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.9945999979972839,"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/disjoint-sets","display_name":"Disjoint sets","score":0.6836259961128235},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6811552047729492},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5742326974868774},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5719239711761475},{"id":"https://openalex.org/keywords/communication-source","display_name":"Communication source","score":0.5539431571960449},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5511868596076965},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.48663195967674255},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4725874364376068},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4615177810192108},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.43694111704826355},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38157013058662415},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3728494644165039},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.334983229637146},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.09665235877037048}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6836259961128235},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6811552047729492},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5742326974868774},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5719239711761475},{"id":"https://openalex.org/C198104137","wikidata":"https://www.wikidata.org/wiki/Q974688","display_name":"Communication source","level":2,"score":0.5539431571960449},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5511868596076965},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.48663195967674255},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4725874364376068},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4615177810192108},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.43694111704826355},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38157013058662415},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3728494644165039},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.334983229637146},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.09665235877037048},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1287/opre.40.5.923","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.40.5.923","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:inm:oropre:v:40:y:1992:i:5:p:923-935","is_oa":false,"landing_page_url":"http://doi.org/10.1287/opre.40.5.923","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1570068679","https://openalex.org/W1971612468","https://openalex.org/W1997556777","https://openalex.org/W2008292658","https://openalex.org/W2030590435","https://openalex.org/W2060632898","https://openalex.org/W2061496873","https://openalex.org/W2067661972","https://openalex.org/W2071114738","https://openalex.org/W2090359754","https://openalex.org/W2134867658","https://openalex.org/W2150476282","https://openalex.org/W2169124940"],"related_works":["https://openalex.org/W90906771","https://openalex.org/W2018828772","https://openalex.org/W2529185025","https://openalex.org/W2809723425","https://openalex.org/W2052708136","https://openalex.org/W2005302727","https://openalex.org/W3082028334","https://openalex.org/W2891477601","https://openalex.org/W1490360359","https://openalex.org/W1968084791"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"a":[3,46,61,70,91,107],"randomized":[4],"algorithm":[5,17,34,103],"for":[6],"solving":[7],"the":[8,28,51,55,73,80],"maximum-flow":[9],"maximum-cut":[10],"problem":[11,83],"on":[12,72],"connected":[13],"random":[14],"graphs.":[15],"The":[16,102],"is":[18,35,67,84,115],"very":[19],"fast\u2014it":[20],"does":[21],"not":[22],"look":[23],"up":[24],"most":[25],"vertices":[26],"in":[27],"graph.":[29],"Another":[30],"feature":[31],"of":[32,48,50,63,94,100],"this":[33],"that":[36,88],"it":[37],"almost":[38],"surely":[39],"provides,":[40],"along":[41],"with":[42],"an":[43,76],"optimal":[44,77],"solution,":[45],"proof":[47],"optimality":[49],"solution.":[52],"In":[53],"addition,":[54],"algorithm's":[56],"solution":[57,78],"is,":[58,89],"by":[59],"construction,":[60],"collection":[62,93],"vertex-disjoint":[64,95],"paths":[65,96],"which":[66],"maximum.":[68],"Under":[69],"restriction":[71],"graph's":[74],"density,":[75],"to":[79,106],"NP-hard":[81],"communication":[82],"provided":[85],"as":[86],"well,":[87],"finding":[90],"maximum":[92],"between":[97],"sender-receiver":[98],"pairs":[99],"terminals.":[101],"lends":[104],"itself":[105],"sublogarithmic":[108],"parallel":[109],"and":[110],"distributed":[111],"implementation.":[112],"Its":[113],"effectiveness":[114],"demonstrated":[116],"via":[117],"extensive":[118],"empirical":[119],"study.":[120]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}