{"id":"https://openalex.org/W1969357318","doi":"https://doi.org/10.1137/0218069","title":"Faster Scaling Algorithms for Network Problems","display_name":"Faster Scaling Algorithms for Network Problems","publication_year":1989,"publication_date":"1989-10-01","ids":{"openalex":"https://openalex.org/W1969357318","doi":"https://doi.org/10.1137/0218069","mag":"1969357318"},"language":"en","primary_location":{"id":"doi:10.1137/0218069","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218069","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5001013961","display_name":"Harold N. Gabow","orcid":"https://orcid.org/0000-0002-9775-3492"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Harold N. Gabow","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001013961"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.2194,"has_fulltext":false,"cited_by_count":420,"citation_normalized_percentile":{"value":0.97224594,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"18","issue":"5","first_page":"1013","last_page":"1036"},"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.9965999722480774,"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.9965000152587891,"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/bipartite-graph","display_name":"Bipartite graph","score":0.7947922945022583},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6561170816421509},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.5993734002113342},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.5813137292861938},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5564099550247192},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5532262325286865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5253579020500183},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.437760591506958},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4335954487323761},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4261581003665924},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39030835032463074},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3446415960788727}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7947922945022583},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6561170816421509},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.5993734002113342},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.5813137292861938},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5564099550247192},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5532262325286865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5253579020500183},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.437760591506958},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4335954487323761},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4261581003665924},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39030835032463074},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3446415960788727},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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":4,"locations":[{"id":"doi:10.1137/0218069","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218069","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:ADA194032","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA194032","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.5647","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.5647","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-Tarjan-scaling-bipartite-matching.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.295.5639","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.5639","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/courses/archive/fall09/cos521/Handouts/fasterscaling/","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1493391054","https://openalex.org/W1513400187","https://openalex.org/W1655990431","https://openalex.org/W1970403725","https://openalex.org/W1992060486","https://openalex.org/W2001274023","https://openalex.org/W2008292658","https://openalex.org/W2009070933","https://openalex.org/W2011039300","https://openalex.org/W2023367804","https://openalex.org/W2041670460","https://openalex.org/W2053913299","https://openalex.org/W2061872629","https://openalex.org/W2064284095","https://openalex.org/W2069323107","https://openalex.org/W2084224084","https://openalex.org/W2085917651","https://openalex.org/W2090359754","https://openalex.org/W2091299439","https://openalex.org/W2113491433","https://openalex.org/W2125690626","https://openalex.org/W2139559590","https://openalex.org/W2149342630","https://openalex.org/W2150154671","https://openalex.org/W2157529519","https://openalex.org/W2203446654","https://openalex.org/W2222512263","https://openalex.org/W2227557434","https://openalex.org/W2289048564","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3161514703","https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W2098682899","https://openalex.org/W4206915070","https://openalex.org/W2080904092","https://openalex.org/W2531764854","https://openalex.org/W2051329268","https://openalex.org/W1994440468","https://openalex.org/W2182648737"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"algorithms":[3,20,86],"for":[4,34],"the":[5,8,12,31,35,42,66,92],"assignment":[6,43],"problem,":[7,10],"transportation":[9],"and":[11,63,73,96],"minimum-cost":[13,23,46],"flow":[14],"problem":[15,44,101],"of":[16,68,71,76,94],"operations":[17],"research.":[18],"The":[19,85],"find":[21],"a":[22,49,77],"solution,":[24],"yet":[25],"run":[26],"in":[27,48,55,91,98],"time":[28],"close":[29],"to":[30,82],"best-known":[32],"bounds":[33],"corresponding":[36],"problems":[37],"without":[38],"costs.":[39],"For":[40],"example,":[41],"(equivalently,":[45],"matching":[47],"bipartite":[50],"graph)":[51],"can":[52],"be":[53,83],"solved":[54],"$O(\\sqrt":[56],"{nm}":[57],"\\log":[58],"(nN))$":[59],"time,":[60],"where":[61],"$n,m$,":[62],"N":[64],"denote":[65],"number":[67,70],"vertices,":[69],"edges,":[72],"largest":[74],"magnitude":[75],"cost;":[78],"costs":[79],"are":[80],"assumed":[81],"integral.":[84],"work":[87,93],"by":[88],"scaling.":[89],"As":[90],"Goldberg":[95],"Tarjan,":[97],"each":[99],"scaled":[100],"an":[102,110],"approximate":[103],"optimum":[104],"solution":[105],"is":[106],"found,":[107],"rather":[108],"than":[109],"exact":[111],"optimum.":[112]},"counts_by_year":[{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":17},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":16},{"year":2013,"cited_by_count":16},{"year":2012,"cited_by_count":23}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}