{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1363386073366736896.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1002/ecja.4400670203"}},{"identifier":{"@type":"URI","@value":"https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fecja.4400670203"}},{"identifier":{"@type":"URI","@value":"https://onlinelibrary.wiley.com/doi/pdf/10.1002/ecja.4400670203"}},{"identifier":{"@type":"NAID","@value":"210000178703"}}],"dc:title":[{"@value":"Algorithms for plane multicommodity flows"}],"description":[{"type":"abstract","notation":[{"@value":"<jats:title>Abstract</jats:title><jats:p>This paper presents a polynomial‐time algorithm which can determine the multicommodity flows in a planar undirected graph G. It is assumed that G remains planar if an edge is added between each source‐sink pair. Given positive and real demand to each source‐sink pair, the algorithm determines whether or not there exists a multicommodity flow in G realizing the specified demand, i.e., feasibility, and if it exists, the multicommodity flow is determined. It is shown that by solving the maximum‐weight matching problem once for a graph which is a modification of the graph dual to the given graph G, the feasibility is determined, and by solving the problem for 0(kn) times, the multicommodity flows are determined. Consequently, if G has n vertices and k source‐sink pairs, the computation time required to determine the feasibility is 0(n2 log n), and the time required to determine the k‐commodity flow is 0(kn3 log n). the memory storage required is 0(kn). It is known that the maximum‐flow min‐cut theorem exists for the case of planar graph considered in this paper.</jats:p>"}]}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1580572858044945536","@type":"Researcher","personIdentifier":[{"@type":"NRID","@value":"9000415203130"}],"foaf:name":[{"@value":"Kazuhiko Matsumoto"}]},{"@id":"https://cir.nii.ac.jp/crid/1410001205642204290","@type":"Researcher","personIdentifier":[{"@type":"NRID","@value":"9000415145244"},{"@type":"NRID","@value":"9000415229755"},{"@type":"NRID","@value":"9000017681163"},{"@type":"NRID","@value":"9000002297889"},{"@type":"NRID","@value":"9000004845815"},{"@type":"NRID","@value":"9000016260032"},{"@type":"NRID","@value":"9000107324925"},{"@type":"NRID","@value":"9000415203131"},{"@type":"NRID","@value":"9000004909310"},{"@type":"NRID","@value":"9000415147898"},{"@type":"NRID","@value":"9000001107637"},{"@type":"NRID","@value":"9000004796053"},{"@type":"NRID","@value":"9000009632297"},{"@type":"NRID","@value":"9000004788982"},{"@type":"NRID","@value":"9000004870196"},{"@type":"NRID","@value":"9000415163297"},{"@type":"NRID","@value":"9000004788352"},{"@type":"NRID","@value":"9000004835893"},{"@type":"NRID","@value":"9000347051075"},{"@type":"NRID","@value":"9000004889720"},{"@type":"NRID","@value":"9000415164308"},{"@type":"NRID","@value":"9000021558357"},{"@type":"NRID","@value":"9000016492351"},{"@type":"NRID","@value":"9000415176536"},{"@type":"NRID","@value":"9000347053783"},{"@type":"NRID","@value":"9000004791930"},{"@type":"NRID","@value":"9000413739686"},{"@type":"NRID","@value":"9000413697250"},{"@type":"NRID","@value":"9000023865390"},{"@type":"NRID","@value":"9000004799483"},{"@type":"NRID","@value":"9000004806834"},{"@type":"NRID","@value":"9000017689774"},{"@type":"NRID","@value":"9000004889753"},{"@type":"NRID","@value":"9000347053790"},{"@type":"NRID","@value":"9000415234280"},{"@type":"NRID","@value":"9000004909313"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/read0168367"}],"foaf:name":[{"@value":"Takao Nishizeki"}]},{"@id":"https://cir.nii.ac.jp/crid/1580572858044945408","@type":"Researcher","personIdentifier":[{"@type":"NRID","@value":"9000415203132"}],"foaf:name":[{"@value":"Nobuji Saito"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"87566621"},{"@type":"EISSN","@value":"15206424"}],"prism:publicationName":[{"@value":"Electronics and Communications in Japan (Part I: Communications)"}],"dc:publisher":[{"@value":"Wiley"}],"prism:publicationDate":"1984-01","prism:volume":"67","prism:number":"2","prism:startingPage":"9","prism:endingPage":"16"},"reviewed":"false","dc:rights":["http://onlinelibrary.wiley.com/termsAndConditions#vor"],"url":[{"@id":"https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fecja.4400670203"},{"@id":"https://onlinelibrary.wiley.com/doi/pdf/10.1002/ecja.4400670203"}],"createdAt":"2007-07-13","modifiedAt":"2023-10-20","foaf:topic":[{"@id":"https://cir.nii.ac.jp/all?q=Electrical%20and%20Electronic%20Engineering","dc:title":"Electrical and Electronic Engineering"},{"@id":"https://cir.nii.ac.jp/all?q=Computer%20Networks%20and%20Communications","dc:title":"Computer Networks and Communications"}],"relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360292620677682944","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1361137044729745920","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A Short Proof of the Factor Theorem for Finite Graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1361418518489157504","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"On Odd Cuts and Plane Multicommodity Flows"}]},{"@id":"https://cir.nii.ac.jp/crid/1361981468919126272","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Multicommodity flows in planar graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1361981470199690240","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Minimal complete matchings and negative cycles"}]},{"@id":"https://cir.nii.ac.jp/crid/1363388845836568960","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Maximal Flow Through a Network"}]},{"@id":"https://cir.nii.ac.jp/crid/1363670320879251712","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A note on two problems in connexion with graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1370861288145412608","@type":"Product","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A polynomial‐time algorithm to determine the multicommodity flow in a planar graph"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1002/ecja.4400670203"},{"@type":"CIA","@value":"210000178703"},{"@type":"OPENAIRE","@value":"doi_dedup___::94af778547d54abe7a36c694d4af5215"}]}