{"id":"https://openalex.org/W2089016801","doi":"https://doi.org/10.1007/bf01594940","title":"Use of dynamic trees in a network simplex algorithm for the maximum flow problem","display_name":"Use of dynamic trees in a network simplex algorithm for the maximum flow problem","publication_year":1991,"publication_date":"1991-03-01","ids":{"openalex":"https://openalex.org/W2089016801","doi":"https://doi.org/10.1007/bf01594940","mag":"2089016801"},"language":"en","primary_location":{"id":"doi:10.1007/bf01594940","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01594940","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5111783338","display_name":"Andrew V. Goldberg","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrew V. Goldberg","raw_affiliation_strings":["Department of Computer Science, Stanford University, 94305, Stanford, CA, USA","Department of Computer Science , Stanford University, Stanford, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, 94305, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Computer Science , Stanford University, Stanford, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084098678","display_name":"Michael D. Grigoriadis","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael D. Grigoriadis","raw_affiliation_strings":["Department of Computer Science, Rutgers University, 08903, New Brunswick, NJ, USA","[Department of Computer Science, Rutgers University, New Brunswick, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University, 08903, New Brunswick, NJ, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"[Department of Computer Science, Rutgers University, New Brunswick, USA]","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[{"id":"https://openalex.org/I73544541","display_name":"Mathematical Sciences Research Institute","ror":"https://ror.org/05hs5r386","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I73544541"]},{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]},{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":["AT&T Bell Laboratories, 07974, Murray Hill, NY, USA","Department of Computer Science, Princeton University, 08544, Princeton, NJ, USA","Department of Computer Science, Princeton University, Princeton, USA","AT&T Bell Laboratories, Murray Hill, USA"],"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories, 07974, Murray Hill, NY, USA","institution_ids":["https://openalex.org/I73544541"]},{"raw_affiliation_string":"Department of Computer Science, Princeton University, 08544, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"AT&T Bell Laboratories, Murray Hill, USA","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111783338"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":5.6446,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.97052871,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"50","issue":"1-3","first_page":"277","last_page":"290"},"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.9979000091552734,"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.9979000091552734,"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.9962999820709229,"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/T11106","display_name":"Data Management and Algorithms","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/maximum-flow-problem","display_name":"Maximum flow problem","score":0.730404257774353},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6738784313201904},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6120314002037048},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6049066185951233},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5893402099609375},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.5639992952346802},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5290766358375549},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.5224320292472839},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4479132890701294},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38484758138656616},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32707464694976807},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2531184256076813},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.17530423402786255}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.730404257774353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6738784313201904},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6120314002037048},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6049066185951233},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5893402099609375},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.5639992952346802},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5290766358375549},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5224320292472839},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4479132890701294},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38484758138656616},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32707464694976807},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2531184256076813},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.17530423402786255},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf01594940","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01594940","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.154.862","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.862","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.tau.ac.il/~sagihed/dsw10a/goldberg-grigoriadis-tarjan-network-simplex.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1561880747","https://openalex.org/W1964119857","https://openalex.org/W1981806531","https://openalex.org/W1987927249","https://openalex.org/W2018804864","https://openalex.org/W2029479369","https://openalex.org/W2046043928","https://openalex.org/W2053913299","https://openalex.org/W2056178482","https://openalex.org/W2069323107","https://openalex.org/W2085049270","https://openalex.org/W2090359754","https://openalex.org/W2091720300","https://openalex.org/W2109567578","https://openalex.org/W2125690626","https://openalex.org/W2127470768","https://openalex.org/W2130055503","https://openalex.org/W2182811131","https://openalex.org/W3014094413","https://openalex.org/W4230397637","https://openalex.org/W4301216918","https://openalex.org/W7039908818"],"related_works":["https://openalex.org/W2185826091","https://openalex.org/W2048470382","https://openalex.org/W2477407501","https://openalex.org/W2384679317","https://openalex.org/W2911215968","https://openalex.org/W2375873432","https://openalex.org/W1583787753","https://openalex.org/W1570109187","https://openalex.org/W2625547693","https://openalex.org/W2011545080"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}