{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:23:41Z","timestamp":1725758621055},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452772"},{"type":"electronic","value":"9783642452789"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45278-9_36","type":"book-chapter","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T15:35:18Z","timestamp":1385393718000},"page":"423-427","source":"Crossref","is-referenced-by-count":1,"title":["Maximum st-Flow in Directed Planar Graphs via Shortest Paths"],"prefix":"10.1007","author":[{"given":"Glencora","family":"Borradaile","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Harutyunyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Borradaile, G.: Exploiting Planarity for Network Flow and Connectivity Problems. PhD thesis, Brown University (2008)","DOI":"10.1007\/978-0-387-30162-4_295"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Borradaile, G., Harutyunyan, A.: Maximum st-flow in directed planar graphs via shortest paths. Technical report, arXiv:1305.5823 (2013)","DOI":"10.1007\/978-3-642-45278-9_36"},{"key":"36_CR3","series-title":"LNCS","volume-title":"IWOCA 2013","author":"G. Borradaile","year":"2013","unstructured":"Borradaile, G., Harutyunyan, A.: Boundary-to-boundary flows in planar graphs. In: Lecroq, T., Mouchard, L. (eds.) IWOCA 2013. LNCS, vol.\u00a08288, Springer, Heidelberg (2013)"},{"issue":"2","key":"36_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1502793.1502798","volume":"56","author":"G. Borradaile","year":"2009","unstructured":"Borradaile, G., Klein, P.: An O(n logn) algorithm for maximum st-flow in a directed planar graph. J. of the ACM\u00a056(2), 1\u201330 (2009)","journal-title":"J. of the ACM"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Erickson, J.: Maximum flows and parametric shortest paths in planar graphs. In: Proc. SODA, pp. 794\u2013804 (2010)","DOI":"10.1137\/1.9781611973075.65"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"C. Ford","year":"1956","unstructured":"Ford, C., Fulkerson, D.: Maximal flow through a network. Canadian J. Math.\u00a08, 399\u2013404 (1956)","journal-title":"Canadian J. Math."},{"key":"36_CR7","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. IPL\u00a013, 107 (1981)","journal-title":"IPL"},{"issue":"4","key":"36_CR8","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.1080.0524","volume":"56","author":"D. Hochbaum","year":"2008","unstructured":"Hochbaum, D.: The pseudoflow algorithm: A new algorithm for the maximum-flow problem. Operations Research\u00a056(4), 992\u20131009 (2008)","journal-title":"Operations Research"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Johnson, D., Venkatesan, S.: Partition of planar flow networks. In: Proc. SFCS, pp. 259\u2013264 (1983)","DOI":"10.1109\/SFCS.1983.44"},{"key":"36_CR10","unstructured":"Kaplan, H., Nussbaum, Y.: Minimum st-cut in undirected planar graphs when the source and the sink are close. In: Proc. STACS, pp. 117\u2013128 (2011)"},{"issue":"3","key":"36_CR11","first-page":"362","volume":"26","author":"D. Sleator","year":"1983","unstructured":"Sleator, D., Tarjan, R.: A data structure for dynamic trees. JCSS\u00a026(3), 362\u2013391 (1983)","journal-title":"JCSS"},{"key":"36_CR12","unstructured":"Spanier, E.: Algebraic Topology. Springer (1994)"},{"issue":"4.5\u20135","key":"36_CR13","first-page":"4","volume":"14","author":"R. Tarjan","year":"2010","unstructured":"Tarjan, R., Werneck, R.: Dynamic trees in practice. J. Exp. Algorithmics 14, 5:4.5\u20135:4.23 (2010)","journal-title":"J. Exp. Algorithmics"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45278-9_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T18:35:17Z","timestamp":1558722917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45278-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452772","9783642452789"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45278-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}