{"id":"https://openalex.org/W2741786970","doi":"https://doi.org/10.1137/15m1042929","title":"Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time","display_name":"Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2741786970","doi":"https://doi.org/10.1137/15m1042929","mag":"2741786970"},"language":"en","primary_location":{"id":"doi:10.1137/15m1042929","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1042929","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/A5108529502","display_name":"Glencora Borradaile","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Glencora Borradaile","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Philip N. Klein","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002336559","display_name":"Shay Mozes","orcid":"https://orcid.org/0000-0001-9262-1821"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shay Mozes","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017601108","display_name":"Yahav Nussbaum","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yahav Nussbaum","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5077977985","display_name":"Christian Wulff\u2010Nilsen","orcid":"https://orcid.org/0000-0002-3699-7821"},"institutions":[{"id":"https://openalex.org/I4210116091","display_name":"Department of Physics, Mathematics and Informatics","ror":"https://ror.org/023sm4k53","country_code":"BY","type":"facility","lineage":["https://openalex.org/I151823869","https://openalex.org/I4210116091"]}],"countries":["BY"],"is_corresponding":false,"raw_author_name":"Christian Wulff-Nilsen","raw_affiliation_strings":["K\u00f8benhavns Universitet, Faculty of Science, Department of Computer Science, Department of Computer Science, DK"],"affiliations":[{"raw_affiliation_string":"K\u00f8benhavns Universitet, Faculty of Science, Department of Computer Science, Department of Computer Science, DK","institution_ids":["https://openalex.org/I4210116091"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5108529502"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":13.5521,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.98802716,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"46","issue":"4","first_page":"1280","last_page":"1303"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973999857902527,"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.9972000122070312,"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/feedback-arc-set","display_name":"Feedback arc set","score":0.6420290470123291},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.621553897857666},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6045536994934082},{"id":"https://openalex.org/keywords/sink","display_name":"Sink (geography)","score":0.5849303007125854},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5696485638618469},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5183237791061401},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5170333981513977},{"id":"https://openalex.org/keywords/book-embedding","display_name":"Book embedding","score":0.49498337507247925},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.47712019085884094},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.45497652888298035},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45447948575019836},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37854209542274475},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3738606572151184},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34270408749580383},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2518582344055176},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16054898500442505},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.07524529099464417}],"concepts":[{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.6420290470123291},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.621553897857666},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6045536994934082},{"id":"https://openalex.org/C143050476","wikidata":"https://www.wikidata.org/wiki/Q194502","display_name":"Sink (geography)","level":2,"score":0.5849303007125854},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5696485638618469},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5183237791061401},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5170333981513977},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.49498337507247925},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.47712019085884094},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.45497652888298035},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45447948575019836},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37854209542274475},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3738606572151184},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34270408749580383},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2518582344055176},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16054898500442505},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.07524529099464417},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/15m1042929","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1042929","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:oai:pure.atira.dk:openaire_cris_publications/e8d49ac8-9a1f-48c0-97aa-49cd1e952ff8","is_oa":false,"landing_page_url":"https://curis.ku.dk/portal/da/publications/multiplesource-multiplesink-maximum-flow-in-directed-planar-graphs-in-nearlinear-time(e8d49ac8-9a1f-48c0-97aa-49cd1e952ff8).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Borradaile , G , Klein , P N , Mozes , S , Nussbaum , Y & Wulff-Nilsen , C 2017 , ' Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time ' , SIAM Journal on Computing , vol. 46 , no. 4 , pp. 1280-1303 . https://doi.org/10.1137/15M1042929","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/e8d49ac8-9a1f-48c0-97aa-49cd1e952ff8","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/e8d49ac8-9a1f-48c0-97aa-49cd1e952ff8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Borradaile , G , Klein , P N , Mozes , S , Nussbaum , Y & Wulff-Nilsen , C 2017 , ' Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time ' , SIAM Journal on Computing , vol. 46 , no. 4 , pp. 1280-1303 . https://doi.org/10.1137/15M1042929","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3513069533","display_name":null,"funder_award_id":"974/13","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G3980467030","display_name":null,"funder_award_id":"822/10","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G4287868585","display_name":null,"funder_award_id":"CCF-0964037","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7584120202","display_name":null,"funder_award_id":"CCF-0963921","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7965623349","display_name":null,"funder_award_id":"Center No. 4/11","funder_id":"https://openalex.org/F4320335016","funder_display_name":"Israeli Centers for Research Excellence"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320335016","display_name":"Israeli Centers for Research Excellence","ror":"https://ror.org/03w2v9593"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W79315950","https://openalex.org/W1964849735","https://openalex.org/W1988593903","https://openalex.org/W1995229611","https://openalex.org/W2008597108","https://openalex.org/W2013347084","https://openalex.org/W2018804864","https://openalex.org/W2020999234","https://openalex.org/W2022980325","https://openalex.org/W2028558845","https://openalex.org/W2034509988","https://openalex.org/W2049413646","https://openalex.org/W2061130579","https://openalex.org/W2068557906","https://openalex.org/W2070505654","https://openalex.org/W2090359754","https://openalex.org/W2099463627","https://openalex.org/W2109920117","https://openalex.org/W2113137767","https://openalex.org/W2126789858","https://openalex.org/W2137849348","https://openalex.org/W2138560648","https://openalex.org/W2143516773","https://openalex.org/W2147965279","https://openalex.org/W2147969479","https://openalex.org/W2592415985","https://openalex.org/W2762935521","https://openalex.org/W2768149714"],"related_works":["https://openalex.org/W4214487273","https://openalex.org/W4287028074","https://openalex.org/W2354764436","https://openalex.org/W3191289342","https://openalex.org/W4297817344","https://openalex.org/W2555805899","https://openalex.org/W1512669878","https://openalex.org/W2962948471","https://openalex.org/W2603633312","https://openalex.org/W2792615373"],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2,9],"$O(n":[3],"\\log^3":[4],"n)$":[5],"algorithm":[6],"that,":[7],"given":[8],"$n$-node":[10],"directed":[11],"planar":[12],"graph":[13],"with":[14],"arc":[15],"capacities,":[16],"a":[17,23,29],"set":[18,24],"of":[19,25],"source":[20],"nodes,":[21],"and":[22],"sink":[26],"nodes":[27],"finds":[28],"maximum":[30],"flow":[31],"from":[32],"the":[33,36,39],"sources":[34],"to":[35],"sinks.":[37],"Previously,":[38],"fastest":[40],"algorithms":[41],"known":[42],"for":[43,48],"this":[44],"problem":[45],"were":[46],"those":[47],"general":[49],"graphs.":[50]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}