{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:57:28Z","timestamp":1725537448549},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_36","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"397-407","source":"Crossref","is-referenced-by-count":1,"title":["Maximum Flow in Directed Planar Graphs with Vertex Capacities"],"prefix":"10.1007","author":[{"given":"Haim","family":"Kaplan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yahav","family":"Nussbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New Jersey (1993)"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Borradaile, G., Klein, P.: An O(n logn) algorithm for maximum st-flow in a directed planar graph. J. ACM\u00a056 (2009)","DOI":"10.1145\/1502793.1502798"},{"key":"36_CR3","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, New Jersey (1962)"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0020-0190(81)90120-4","volume":"13","author":"R. Hassin","year":"1981","unstructured":"Hassin, R.: Maximum flow in (s, t) planar networks. Information Processing Letters\u00a013, 107 (1981)","journal-title":"Information Processing Letters"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jcss.1997.1493","volume":"55","author":"M.R. Henzinger","year":"1997","unstructured":"Henzinger, M.R., Klein, P., Rao, S., Subramania, S.: Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci.\u00a055, 3\u201323 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1145\/31846.31849","volume":"34","author":"D.B. Johnson","year":"1987","unstructured":"Johnson, D.B.: Parallel algorithms for minimum cuts and maximum flows in planar networks. J. ACM\u00a034, 950\u2013967 (1987)","journal-title":"J. ACM"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF01240733","volume":"11","author":"S. Khuller","year":"1994","unstructured":"Khuller, S., Naor, J.: Flow in planar graphs with vertex capacities. Algorithmica\u00a011, 200\u2013225 (1994)","journal-title":"Algorithmica"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1137\/0406038","volume":"63","author":"S. Khuller","year":"1993","unstructured":"Khuller, S., Naor, J., Klein, P.: The lattice structure of flow in planar graphs. SIAM J. Disc. Math.\u00a063, 477\u2013490 (1993)","journal-title":"SIAM J. Disc. Math."},{"key":"36_CR9","series-title":"Ann. Discrete Math","volume-title":"Planar Graphs: Theory and Algorithms","author":"T. Nishizwki","year":"1988","unstructured":"Nishizwki, T., Chiba, N.: Planar Graphs: Theory and Algorithms. Ann. Discrete Math, vol.\u00a032. North-Holland, Amsterdam (1988)"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1137\/S0097539793253565","volume":"26","author":"H. Ripphausen-Lipa","year":"1997","unstructured":"Ripphausen-Lipa, H., Wagner, D., Weihe, K.: The vertex-disjoint Menger problem in planar graphs. SIAM J. Comput.\u00a026, 331\u2013349 (1997)","journal-title":"SIAM J. Comput."},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1006\/jcss.1997.1538","volume":"55","author":"K. Weihe","year":"1997","unstructured":"Weihe, K.: Maximum (s, t)-flows in planar networks in O(|V|log|V|)-time. J. Comput. Syst. Sci.\u00a055, 454\u2013476 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.ipl.2006.06.001","volume":"100","author":"X. Zhang","year":"2006","unstructured":"Zhang, X., Liang, W., Jiang, H.: Flow equivalent trees in node-edge-capacitated undirected planar graphs. Information Processing Letters\u00a0100, 100\u2013115 (2006)","journal-title":"Information Processing Letters"},{"key":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-540-69733-6_57","volume-title":"Computing and Combinatorics","author":"X. Zhang","year":"2008","unstructured":"Zhang, X., Liang, W., Chen, G.: Computing maximum flows in undirected planar networks with both edge and vertex capacities. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol.\u00a05092, pp. 577\u2013586. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:22:15Z","timestamp":1558524135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}