{"id":"https://openalex.org/W2147133278","doi":"https://doi.org/10.1145/2628036","title":"Efficient maximum flow algorithms","display_name":"Efficient maximum flow algorithms","publication_year":2014,"publication_date":"2014-07-24","ids":{"openalex":"https://openalex.org/W2147133278","doi":"https://doi.org/10.1145/2628036","mag":"2147133278"},"language":"en","primary_location":{"id":"doi:10.1145/2628036","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2628036","pdf_url":null,"source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","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/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210086253","display_name":"Silicon Valley Community Foundation","ror":"https://ror.org/001ader08","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210086253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrew V. Goldberg","raw_affiliation_strings":["Microsoft Research Silicon Valley Lab, Mountain View, CA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Silicon Valley Lab, Mountain View, CA","institution_ids":["https://openalex.org/I4210086253","https://openalex.org/I1290206253"]}]},{"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/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":["Princeton University, Princeton, NJ"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111783338"],"corresponding_institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210086253"],"apc_list":null,"apc_paid":null,"fwci":8.8665,"has_fulltext":false,"cited_by_count":124,"citation_normalized_percentile":{"value":0.97812838,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"57","issue":"8","first_page":"82","last_page":"89"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9853000044822693,"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.9818000197410583,"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.6039769649505615},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5681238174438477},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.45702287554740906},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.42448678612709045},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.254369854927063},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20917657017707825},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12050315737724304}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6039769649505615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5681238174438477},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.45702287554740906},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.42448678612709045},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.254369854927063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20917657017707825},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12050315737724304}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2628036","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2628036","pdf_url":null,"source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"}],"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/W1499635521","https://openalex.org/W1589226822","https://openalex.org/W1754904414","https://openalex.org/W1918148494","https://openalex.org/W1977545325","https://openalex.org/W1983383464","https://openalex.org/W1996169001","https://openalex.org/W2002531683","https://openalex.org/W2008292658","https://openalex.org/W2008597108","https://openalex.org/W2009281933","https://openalex.org/W2018804864","https://openalex.org/W2029266474","https://openalex.org/W2058622993","https://openalex.org/W2061872629","https://openalex.org/W2090359754","https://openalex.org/W2091084079","https://openalex.org/W2099463627","https://openalex.org/W2106759055","https://openalex.org/W2113137767","https://openalex.org/W2130055503","https://openalex.org/W2133352257","https://openalex.org/W2149342630","https://openalex.org/W2152216760","https://openalex.org/W2153441719","https://openalex.org/W2208409594","https://openalex.org/W2561675875","https://openalex.org/W3014094413","https://openalex.org/W3113130260","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W2051022544","https://openalex.org/W2003930232","https://openalex.org/W2263167076","https://openalex.org/W4311255633","https://openalex.org/W2368007657","https://openalex.org/W2391191500","https://openalex.org/W4297894118","https://openalex.org/W2365398175","https://openalex.org/W1979748118","https://openalex.org/W2018732369"],"abstract_inverted_index":{"Though":[0],"maximum":[1],"flow":[2],"algorithms":[3],"have":[4],"a":[5],"long":[6],"history,":[7],"revolutionary":[8],"progress":[9],"is":[10],"still":[11],"being":[12],"made.":[13]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":17},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":29},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}