{"id":"https://openalex.org/W1989626562","doi":"https://doi.org/10.1137/0214023","title":"An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks","display_name":"An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks","publication_year":1985,"publication_date":"1985-05-01","ids":{"openalex":"https://openalex.org/W1989626562","doi":"https://doi.org/10.1137/0214023","mag":"1989626562"},"language":"en","primary_location":{"id":"doi:10.1137/0214023","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214023","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/A5105308564","display_name":"Kazuhiko Matsumoto","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kazuhiko Matsumoto","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033580185","display_name":"Takao Nishizeki","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Takao Nishizeki","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111983740","display_name":"Nobuji Saito","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nobuji Saito","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5105308564"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.1156,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.91663613,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"14","issue":"2","first_page":"289","last_page":"302"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.998199999332428,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.998199999332428,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9973000288009644,"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.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.642108142375946},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6338295936584473},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6298773288726807},{"id":"https://openalex.org/keywords/sink","display_name":"Sink (geography)","score":0.6189497709274292},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5947558283805847},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.5770092010498047},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.48635393381118774},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4451165795326233},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.43286460638046265},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4288749694824219},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4283156096935272},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3607133626937866},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.27749842405319214},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25937747955322266}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.642108142375946},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6338295936584473},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6298773288726807},{"id":"https://openalex.org/C143050476","wikidata":"https://www.wikidata.org/wiki/Q194502","display_name":"Sink (geography)","level":2,"score":0.6189497709274292},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5947558283805847},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.5770092010498047},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.48635393381118774},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4451165795326233},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.43286460638046265},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4288749694824219},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4283156096935272},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3607133626937866},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.27749842405319214},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25937747955322266},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"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},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0214023","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214023","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":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1963501983","https://openalex.org/W1985005008","https://openalex.org/W2018804864","https://openalex.org/W2039086323","https://openalex.org/W2046533673","https://openalex.org/W2052768371","https://openalex.org/W2070505654","https://openalex.org/W2169528473","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W2916043681","https://openalex.org/W2906860838","https://openalex.org/W1906268133","https://openalex.org/W2147954430","https://openalex.org/W2031552172","https://openalex.org/W2622090745","https://openalex.org/W2583782779","https://openalex.org/W2020400310","https://openalex.org/W2142779979","https://openalex.org/W3135388429"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3,17],"efficient":[4],"algorithm":[5,45],"for":[6,40],"finding":[7],"multicommodity":[8,50],"flows":[9],"in":[10],"planar":[11,19],"graphs.":[12],"Suppose":[13],"that":[14,34],"G":[15,48,69,84],"is":[16,38],"undirected":[18],"graph":[20],"with":[21],"all":[22],"sources":[23],"and":[24,33,59,64,80,88],"sinks":[25],"on":[26],"the":[27,30],"boundary":[28],"of":[29,60],"outer":[31],"face":[32],"a":[35,54,57,61],"real-valued":[36],"demand":[37],"given":[39,62],"each":[41,52],"source\u2013sink":[42,90],"pair.":[43],"The":[44],"decides":[46],"whether":[47],"has":[49,85],"flows,":[51],"from":[53],"source":[55],"to":[56],"sink":[58],"demand,":[63],"actually":[65],"finds":[66],"them":[67],"if":[68,83],"has.":[70],"It":[71],"spends":[72],"$O(kn":[73],"+":[74],"n^2":[75],"(\\log":[76],"n)^{1/2}":[77],")$":[78],"time":[79],"$O(kn)$":[81],"space":[82],"n":[86],"vertices":[87],"k":[89],"pairs.":[91]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-14T08:43:22.919905","created_date":"2025-10-10T00:00:00"}