{"id":"https://openalex.org/W4387704917","doi":"https://doi.org/10.1137/22m1494804","title":"Finding Maximum Edge-Disjoint Paths Between Multiple Terminals","display_name":"Finding Maximum Edge-Disjoint Paths Between Multiple Terminals","publication_year":2023,"publication_date":"2023-10-17","ids":{"openalex":"https://openalex.org/W4387704917","doi":"https://doi.org/10.1137/22m1494804"},"language":"en","primary_location":{"id":"doi:10.1137/22m1494804","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1494804","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/A5040460257","display_name":"Satoru Iwata","orcid":"https://orcid.org/0000-0002-6467-1335"},"institutions":[{"id":"https://openalex.org/I205349734","display_name":"Hokkaido University","ror":"https://ror.org/02e16g702","country_code":"JP","type":"education","lineage":["https://openalex.org/I205349734"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Satoru Iwata","raw_affiliation_strings":["Department of Mathematical Informatics, The University of Tokyo, Tokyo 113-8656, Japan, and Institute for Chemical Reaction Design and Discovery, Hokkaido University, Sapporo 001-0021, Japan"],"raw_orcid":"https://orcid.org/0000-0002-6467-1335","affiliations":[{"raw_affiliation_string":"Department of Mathematical Informatics, The University of Tokyo, Tokyo 113-8656, Japan, and Institute for Chemical Reaction Design and Discovery, Hokkaido University, Sapporo 001-0021, Japan","institution_ids":["https://openalex.org/I205349734"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054769049","display_name":"Yu Yokoi","orcid":"https://orcid.org/0000-0002-7316-5434"},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yu Yokoi","raw_affiliation_strings":["Department of Mathematical and Computing Science, School of Computing, Tokyo Institute of Technology, Tokyo 152-8550, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical and Computing Science, School of Computing, Tokyo Institute of Technology, Tokyo 152-8550, Japan","institution_ids":["https://openalex.org/I114531698"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040460257"],"corresponding_institution_ids":["https://openalex.org/I205349734"],"apc_list":null,"apc_paid":null,"fwci":0.388,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65928704,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"52","issue":"5","first_page":"1230","last_page":"1268"},"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.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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.9987000226974487,"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/disjoint-sets","display_name":"Disjoint sets","score":0.6517651081085205},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6420170068740845},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6412082314491272},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5958336591720581},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5360503792762756},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5115176439285278},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5079482197761536},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.473020076751709},{"id":"https://openalex.org/keywords/multigraph","display_name":"Multigraph","score":0.4419942796230316},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.43909382820129395},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4295434057712555},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4256138801574707},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3247360587120056},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3216784596443176},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26565253734588623}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6517651081085205},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6420170068740845},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6412082314491272},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5958336591720581},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5360503792762756},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5115176439285278},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5079482197761536},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.473020076751709},{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.4419942796230316},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.43909382820129395},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4295434057712555},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4256138801574707},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3247360587120056},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3216784596443176},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26565253734588623},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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":1,"locations":[{"id":"doi:10.1137/22m1494804","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1494804","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1448203162","display_name":null,"funder_award_id":"17H01699","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G148285802","display_name":null,"funder_award_id":"CREST JPMJCR14D2","funder_id":"https://openalex.org/F4320334789","funder_display_name":"Japan Science and Technology Agency"},{"id":"https://openalex.org/G1537255609","display_name":null,"funder_award_id":"KAKENHI JP18K18004","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G5620478769","display_name":null,"funder_award_id":"ERATO JPMJER1903","funder_id":"https://openalex.org/F4320334789","funder_display_name":"Japan Science and Technology Agency"},{"id":"https://openalex.org/G8067462367","display_name":null,"funder_award_id":"PRESTO JPMJPR212B","funder_id":"https://openalex.org/F4320334789","funder_display_name":"Japan Science and Technology Agency"},{"id":"https://openalex.org/G964924897","display_name":null,"funder_award_id":"20H05965","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"},{"id":"https://openalex.org/F4320334789","display_name":"Japan Science and Technology Agency","ror":"https://ror.org/00097mb19"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1985061810","https://openalex.org/W1986334784","https://openalex.org/W1987095267","https://openalex.org/W2000065147","https://openalex.org/W2000743971","https://openalex.org/W2016088388","https://openalex.org/W2028503265","https://openalex.org/W2031297526","https://openalex.org/W2032198109","https://openalex.org/W2045083520","https://openalex.org/W2069968725","https://openalex.org/W2091981736","https://openalex.org/W2154896222","https://openalex.org/W2170492169","https://openalex.org/W2599087550","https://openalex.org/W2599477347","https://openalex.org/W2988480584","https://openalex.org/W4233756358"],"related_works":["https://openalex.org/W1986875491","https://openalex.org/W2928744449","https://openalex.org/W4288402605","https://openalex.org/W3048715473","https://openalex.org/W4300815962","https://openalex.org/W2088312182","https://openalex.org/W205329642","https://openalex.org/W4287077747","https://openalex.org/W2016715486","https://openalex.org/W2949690312"],"abstract_inverted_index":{"Let":[0],"be":[1],"a":[2,5,14,34,48,71,84,95,99,127,134,195,204,218],"multigraph":[3],"with":[4],"set":[6],"of":[7,36,40,57,74,87,90,111,139,160,222,227],"terminals.":[8],"A":[9],"path":[10,65],"in":[11,22,78,181],"is":[12,184],"called":[13],"-path":[15],"if":[16],"its":[17],"ends":[18],"are":[19],"distinct":[20],"vertices":[21,26],"and":[23,157,168],"no":[24],"internal":[25],"belong":[27],"to":[28,82,107,197,231],".":[29],"In":[30,43],"1978,":[31],"Mader":[32],"showed":[33],"characterization":[35],"the":[37,54,88,108,121,131,137,140,150,161,188,209,225,228,235],"maximum":[38,55,210],"number":[39,56,89],"edge-disjoint":[41,58,91,142],"-paths.":[42,59,92,143],"this":[44,145],"paper,":[45],"we":[46,69,103],"provide":[47],"combinatorial,":[49],"deterministic":[50,191],"algorithm":[51,61,110,132,179,192,207],"for":[52,98,136,208,217],"finding":[53,126],"The":[60,178],"adopts":[62],"an":[63],"augmenting":[64,76,101,129],"approach.":[66],"More":[67],"specifically,":[68],"utilize":[70],"new":[72],"concept":[73],"short":[75,100,128],"walks":[77],"auxiliary":[79],"labeled":[80],"graphs":[81],"capture":[83],"possible":[85],"augmentation":[86],"To":[93],"design":[94],"search":[96,122],"procedure":[97,123],"walk,":[102,130],"introduce":[104],"blossoms":[105],"analogously":[106],"matching":[109],"Edmonds":[112],"[Canad.":[113],"J.":[114],"Math.,":[115],"17,":[116],"1965,":[117],"pp.":[118,176],"449\u2013467].":[119],"When":[120],"terminates":[124],"without":[125],"provides":[133],"certificate":[135],"optimality":[138],"current":[141],"From":[144],"certificate,":[146],"one":[147],"can":[148],"obtain":[149],"Edmonds\u2013Gallai":[151],"type":[152],"decomposition":[153],"introduced":[154],"by":[155],"Seb\u0151":[156],"Szeg\u0151":[158],"[Proceedings":[159],"Tenth":[162],"International":[163],"Conference":[164],"on":[165,194,234],"Integer":[166],"Programming":[167],"Combinatorial":[169],"Optimization,":[170],"LNCS":[171],"3064,":[172],"Springer,":[173],"Berlin,":[174],"2004,":[175],"256\u2013270].":[177],"runs":[180],"time,":[182],"which":[183,215],"much":[185],"faster":[186],"than":[187],"best":[189],"known":[190],"based":[193],"reduction":[196],"linear":[198],"matroid":[199],"parity.":[200],"We":[201],"also":[202],"present":[203],"strongly":[205],"polynomial":[206],"integer":[211,220],"free":[212],"multiflow":[213],"problem,":[214],"asks":[216],"nonnegative":[219],"combination":[221],"-paths":[223],"maximizing":[224],"sum":[226],"coefficients":[229],"subject":[230],"capacity":[232],"constraints":[233],"edges.":[236]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}