{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:30:50Z","timestamp":1787340650080,"version":"build-2736575974"},"reference-count":15,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,5]]},"abstract":"<jats:p>This paper presents an efficient algorithm for finding multicommodity flows in planar graphs. Suppose that G is an undirected planar graph with all sources and sinks on the boundary of the outer face and that a real-valued demand is given for each source\u2013sink pair. The algorithm decides whether G has multicommodity flows, each from a source to a sink and of a given demand, and actually finds them if G has. It spends $O(kn + n^2 (\\log n)^{1\/2} )$ time and $O(kn)$ space if G has n vertices and k source\u2013sink pairs.<\/jats:p>","DOI":"10.1137\/0214023","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"289-302","source":"Crossref","is-referenced-by-count":27,"title":["An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks"],"prefix":"10.1137","volume":"14","author":[{"given":"Kazuhiko","family":"Matsumoto","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nobuji","family":"Saito","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","volume-title":"The design and analysis of computer algorithms","author":"Aho Alfred V.","year":"1975"},{"key":"R2","unstructured":"H. Diaz, G. de Ghellinck,  Multicommodity maximum flow in palanar networks (the  D-algorithm approach), CORE discussion paper, 7212, Center for Operations Research and Econometrics, Louvain-la-Neuve, Belgium,  1972"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"G. N. Frederickson,  Shortest path problems in planar graphs-preliminary version),  Proc. 24th Symposium on Foundation of Computer Science, Tucson,  1983,  242\u2013247, Nov.","DOI":"10.1109\/SFCS.1983.69"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90120-4"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1145\/322092.322100"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1137\/0208012"},{"key":"R9","first-page":"1093","volume":"244","author":"Khachiyan L. G.","year":"1979","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(81)80012-3"},{"key":"R11","unstructured":"M. Sakarovitch, Masters Thesis,  The multicommodity flow problem, Doctoral thesis, Operations Research Center, Univ. California, Berkeley,  1966"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584644"},{"key":"R13","unstructured":"D. D. Sleator, Masters Thesis,  An  O(nmlogn) algorithm for maximum network flow, Ph.D. dissertation, Computer Science Dept., Stanford Univ., Stanford, CA,  1980"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1964.1082356"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:42:43Z","timestamp":1787337763000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,5]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,5]]}},"alternative-id":["10.1137\/0214023"],"URL":"https:\/\/doi.org\/10.1137\/0214023","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,5]]}}}