{"id":"https://openalex.org/W2084364487","doi":"https://doi.org/10.1109/sfcs.1983.68","title":"Scaling algorithms for network problems","display_name":"Scaling algorithms for network problems","alternate_titles":[],"publication_year":1983,"publication_date":"1983-11-01","ids":{"openalex":"https://openalex.org/W2084364487","doi":"https://doi.org/10.1109/sfcs.1983.68","mag":"2084364487"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.1983.68","doi":"https://doi.org/10.1109/sfcs.1983.68","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1983.68","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"24th Annual Symposium on Foundations of Computer Science (sfcs 1983)","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2084364487"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5001013961","display_name":"Harold N. Gabow","orcid":"https://orcid.org/0000-0002-9775-3492","observed_orcids":["https://orcid.org/0000-0002-9775-3492"]},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Harold N. Gabow","raw_affiliation_strings":["Department of Computer Science, University of Colorado Boulder, Boulder, CO, USA","University of Colorado at Boulder, Boulder#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Colorado Boulder, Boulder, CO, USA","institution_ids":["https://openalex.org/I188538660"]},{"raw_affiliation_string":"University of Colorado at Boulder, Boulder#TAB#","institution_ids":["https://openalex.org/I188538660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001013961"],"corresponding_institution_ids":["https://openalex.org/I188538660"],"apc_list":null,"apc_paid":null,"fwci":1.3636,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.74840764,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"248","last_page":"258"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.0,"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/T11269","display_name":"Algorithms and Data Compression","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scaling-algorithms","display_name":"scaling algorithms","score":0.9509999752044678},{"id":"https://openalex.org/keywords/network-flow-algorithms","display_name":"network flow algorithms","score":0.7039999961853027},{"id":"https://openalex.org/keywords/maximum-weight-bipartite-matching","display_name":"maximum weight bipartite matching","score":0.9160000085830688},{"id":"https://openalex.org/keywords/hungarian-algorithm","display_name":"Hungarian algorithm","score":0.7720000147819519},{"id":"https://openalex.org/keywords/hopcroft-karp-algorithm","display_name":"Hopcroft-Karp algorithm","score":0.8240000009536743},{"id":"https://openalex.org/keywords/single-source-shortest-path","display_name":"single-source shortest path","score":0.8259999752044678},{"id":"https://openalex.org/keywords/bellman-ford-algorithm","display_name":"Bellman-Ford algorithm","score":0.843999981880188},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.7720000147819519},{"id":"https://openalex.org/keywords/minimum-cost-flow","display_name":"minimum cost flow","score":0.8889999985694885},{"id":"https://openalex.org/keywords/time-complexity-bounds","display_name":"time complexity bounds","score":0.5299999713897705}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.8012202978134155},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.735490620136261},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7220805287361145},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6440563201904297},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.6073420643806458},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.5961186289787292},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5589101314544678},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5363318920135498},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5129072666168213},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.46753284335136414},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45307493209838867},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4383942186832428},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.43299126625061035},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3826662600040436},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.324766606092453},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/sfcs.1983.68","doi":"https://doi.org/10.1109/sfcs.1983.68","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1983.68","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"24th Annual Symposium on Foundations of Computer Science (sfcs 1983)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.5311","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.5311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/%7Epettie/matching/Gabow-scaling-algorithms-for-network-problems.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1655990431","https://openalex.org/W1973942323","https://openalex.org/W1978270311","https://openalex.org/W2008292658","https://openalex.org/W2008816808","https://openalex.org/W2009710482","https://openalex.org/W2022980325","https://openalex.org/W2023367804","https://openalex.org/W2040326319","https://openalex.org/W2041670460","https://openalex.org/W2053913299","https://openalex.org/W2069323107","https://openalex.org/W2085917651","https://openalex.org/W2125690626","https://openalex.org/W2128865241","https://openalex.org/W2149342630","https://openalex.org/W2157529519","https://openalex.org/W2169528473","https://openalex.org/W2222512263","https://openalex.org/W2227557434","https://openalex.org/W2796604629","https://openalex.org/W3014094413","https://openalex.org/W3139993281","https://openalex.org/W4301216918"],"related_works":["https://openalex.org/W7096771633","https://openalex.org/W1922780582","https://openalex.org/W2782000683","https://openalex.org/W2164141517","https://openalex.org/W125735179","https://openalex.org/W2124852572","https://openalex.org/W7095524230","https://openalex.org/W2022168599","https://openalex.org/W2582174719","https://openalex.org/W578380814"],"abstract_inverted_index":{"A":[0,69],"network":[1,20,130,166],"is":[2],"a":[3,77,128,155],"graph":[4,79,157],"with":[5,158],"numeric":[6,27,57,65],"parameters":[7,66],"such":[8,36],"as":[9,37],"edge":[10,116],"lengths,":[11],"capacities,":[12],"costs,":[13],"etc.":[14],"We":[15],"present":[16],"efficient":[17,33],"algorithms":[18,35,138],"for":[19,72,107,114,151],"problems":[21],"that":[22,139],"work":[23],"by":[24],"scaling":[25,70],"the":[26,38,48,60,90,108,141],"parameters.":[28],"Scaling":[29,134],"takes":[30],"advantage":[31],"of":[32,50,53,59],"nonnumeric":[34],"Hopcroft-Karp":[39],"matching":[40,75],"algorithm.":[41],"Let":[42],"n,":[43],"m":[44,83,98],"and":[45,55,132,163,169],"N":[46,147],"denote":[47],"number":[49,52],"vertices,":[51],"edges,":[54],"largest":[56],"parameter":[58],"network,":[61],"respectively;":[62],"assume":[63],"all":[64],"are":[67],"integers.":[68],"algorithm":[71],"maximum":[73,120,164],"weight":[74,121],"on":[76,154],"bipartite":[78],"runs":[80,95],"in":[81,96,127],"O(n3/4":[82],"log":[84,99,146],"N)":[85],"time.":[86,101],"This":[87,102],"can":[88],"improve":[89],"traditional":[91],"Hungarian":[92],"method":[93],"which":[94],"O(n":[97],"n)":[100],"result":[103],"gives":[104,136],"similar":[105],"improvements":[106],"following":[109],"problems:":[110],"single-source":[111],"shortest":[112,152],"paths":[113,153],"arbitrary":[115],"lengths":[117,160],"(Bellman's":[118],"algorithm);":[119],"degree-constrained":[122],"subgraph;":[123],"minimum":[124],"cost":[125],"flow":[126,167],"0-1":[129],"(Edmonds":[131],"Karp).":[133],"also":[135],"simple":[137],"match":[140],"best":[142],"time":[143],"bounds":[144],"(when":[145],"=":[148],"O(log":[149],"n))":[150],"directed":[156],"nonnegative":[159],"(Dijkstra's":[161],"algorithm)":[162],"value":[165],"(Sleator":[168],"Tarjan).":[170]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2084364487","counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
