{"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":false,"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":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2801,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.58782556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"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":"Development of Global Optimization Methods by Generalized Eigenvalue Computation","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":{"grobid_xml":false,"pdf":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":{"Abstract.":[0],"Let":[1],"[Formula:":[2,11,19,25,35,44,59,78,113,167,209,253],"see":[3,12,20,26,36,45,60,79,114,168,210,254],"text]":[4,13,21,37,211],"be":[5],"a":[6,9,24,51,67,92,105,118,122,151,158,225,234,248],"multigraph":[7],"with":[8],"set":[10],"of":[14,53,57,76,95,108,111,134,163,187,252,259],"terminals.":[15],"A":[16],"path":[17,86],"in":[18,34,99,208],"is":[22,214],"called":[23],"text]-path":[27],"if":[28],"its":[29],"ends":[30],"are":[31],"distinct":[32],"vertices":[33,41],"and":[38,183,195],"no":[39],"internal":[40],"belong":[42],"to":[43,103,130,227,263],"text].":[46],"In":[47,62],"1978,":[48],"Mader":[49],"showed":[50],"characterization":[52],"the":[54,73,109,131,145,155,161,164,176,188,218,239,257,260,267],"maximum":[55,74,240],"number":[56,75,110],"edge-disjoint":[58,77,112,166],"text]-paths.":[61,80,115,169],"this":[63,171],"paper,":[64],"we":[65,90,126],"provide":[66],"combinatorial,":[68],"deterministic":[69,221],"algorithm":[70,82,133,156,206,222,237],"for":[71,121,160,238,247],"finding":[72,150],"The":[81,205],"adopts":[83],"an":[84],"augmenting":[85,97,124,153],"approach.":[87],"More":[88],"specifically,":[89],"utilize":[91],"new":[93],"concept":[94],"short":[96,123,152],"walks":[98],"auxiliary":[100],"labeled":[101],"graphs":[102],"capture":[104],"possible":[106],"augmentation":[107],"To":[116],"design":[117],"search":[119,146],"procedure":[120,147],"walk,":[125,154],"introduce":[127],"blossoms":[128],"analogously":[129],"matching":[132],"Edmonds":[135],"[":[136,185],"Canad.":[137],"J.":[138],"Math.,":[139],"17,":[140],"1965,":[141],"pp.":[142,203],"449\u2013467].":[143],"When":[144],"terminates":[148],"without":[149],"provides":[157],"certificate":[159],"optimality":[162],"current":[165],"From":[170],"certificate,":[172],"one":[173],"can":[174],"obtain":[175],"Edmonds\u2013Gallai":[177],"type":[178],"decomposition":[179],"introduced":[180],"by":[181],"Seb\u0151":[182],"Szeg\u0151":[184],"Proceedings":[186],"Tenth":[189],"International":[190],"Conference":[191],"on":[192,224,266],"Integer":[193],"Programming":[194],"Combinatorial":[196],"Optimization,":[197],"LNCS":[198],"3064,":[199],"Springer,":[200],"Berlin,":[201],"2004,":[202],"256\u2013270].":[204],"runs":[207],"time,":[212],"which":[213,245],"much":[215],"faster":[216],"than":[217],"best":[219],"known":[220],"based":[223],"reduction":[226],"linear":[228],"matroid":[229],"parity.":[230],"We":[231],"also":[232],"present":[233],"strongly":[235],"polynomial":[236],"integer":[241,250],"free":[242],"multiflow":[243],"problem,":[244],"asks":[246],"nonnegative":[249],"combination":[251],"text]-paths":[255],"maximizing":[256],"sum":[258],"coefficients":[261],"subject":[262],"capacity":[264],"constraints":[265],"edges.":[268]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-22T07:34:49.880490","created_date":"2025-10-10T00:00:00"}