{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T02:40:26Z","timestamp":1648521626568},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6133,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,10]]},"DOI":"10.1016\/0166-218x(95)00111-4","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"267-283","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial algorithms for (integral) maximum two-flows in vertex edge-capacitated planar graphs"],"prefix":"10.1016","volume":"70","author":[{"given":"Frieda","family":"Granot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Penn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)00111-4_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0166-218X(95)00111-4_BIB2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graph, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0166-218X(95)00111-4_BIB3","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matching, Euler tours and the Chinese postman","volume":"5","author":"Edmonds","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(95)00111-4_BIB4","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0205048","article-title":"On the complexity of the timetable and multicommodity flow problem","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(95)00111-4_BIB5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"8","author":"Ford","year":"1956","journal-title":"Canad. J. Math."},{"key":"10.1016\/0166-218X(95)00111-4_BIB6","series-title":"Paths, Flows, and VLSI \u2014 Layout","article-title":"Packing Path, Circuits, and Cuts \u2014 A Survey","author":"Frank","year":"1990"},{"key":"10.1016\/0166-218X(95)00111-4_BIB7","series-title":"Proceedings of the Integer Programming and Combinational Optimization","first-page":"235","article-title":"On the (integral) maximum two-flow in vertex and edge capacitated planar graphs","author":"Granot","year":"1993"},{"key":"10.1016\/0166-218X(95)00111-4_BIB8","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1137\/0214045","article-title":"An O(n log2 n) algorithm for maximum flow in undirected planar networks","volume":"14","author":"Hassin","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(95)00111-4_BIB9","first-page":"334","article-title":"Multi-commodity network flows","volume":"11","author":"Hu","year":"1993","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(95)00111-4_BIB10","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF01240733","article-title":"Flow in planar graphs with vertex capacities","volume":"11","author":"Khuller","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/0166-218X(95)00111-4_BIB11","first-page":"27","article-title":"Faster shortest-path algorithms for planar graphs","volume":"94","author":"Klein","year":"1994"},{"key":"10.1016\/0166-218X(95)00111-4_BIB12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0166-218X(93)90153-F","article-title":"A fast algorithm for maximum integral two commodity flow in planar graphs","volume":"47","author":"Korach","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(95)00111-4_BIB13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF02579295","article-title":"On the planar integer two-flow problem","volume":"3","author":"Lomonosov","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(95)00111-4_BIB14","article-title":"A fast algorithm for integral two-flow in K3,3-free graphs","author":"Manor","year":"1995"},{"key":"10.1016\/0166-218X(95)00111-4_BIB15","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01202792","article-title":"On the complexity of the disjoint path problem","volume":"13","author":"Middendorf","year":"1993","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(95)00111-4_BIB16","series-title":"Graphs minors XIII. The disjoint paths problem","author":"Robertson","year":"1986"},{"key":"10.1016\/0166-218X(95)00111-4_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584644","article-title":"Two-commodity flows and linear programming","volume":"4","author":"Sakarovitch","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(95)00111-4_BIB18","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1006\/jctb.1993.1062","article-title":"Integer plane multicommodity with a fixed number of demands","volume":"59","author":"Sebo","year":"1993","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(95)00111-4_BIB19","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(80)90158-2","article-title":"Disjoint paths in graphs","volume":"29","author":"Seymour","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00111-4_BIB20","first-page":"178","article-title":"On odd cuts and plane multicommodity flow","volume":"42","author":"Seymour","year":"1981"},{"key":"10.1016\/0166-218X(95)00111-4_BIB21","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1145\/322203.322207","article-title":"A polynomial algorithm for the undirected two paths problem","volume":"27","author":"Shiloach","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0166-218X(95)00111-4_BIB22","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1287\/trsc.2.3.213","article-title":"Maximizing flow through a network with node and arc capacities","volume":"2","author":"Wollmer","year":"1968","journal-title":"Transportation Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X95001114?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X95001114?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:26:05Z","timestamp":1556666765000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X95001114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["0166218X95001114"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)00111-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}