{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:55:35Z","timestamp":1725569735844},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169250"},{"type":"electronic","value":"9783642169267"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16926-7_30","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T07:48:26Z","timestamp":1289375306000},"page":"324-335","source":"Crossref","is-referenced-by-count":3,"title":["Lattices and Maximum Flow Algorithms in Planar Graphs"],"prefix":"10.1007","author":[{"given":"Jannik","family":"Matuschke","sequence":"first","affiliation":[]},{"given":"Britta","family":"Peis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Borradaile, G., Klein, P.: An O(n log n ) algorithm for maximum st-flow in a directed planar graph. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 524\u2013533 (2006)","DOI":"10.1145\/1109557.1109615"},{"key":"30_CR2","unstructured":"Faigle, U., Peis, B.: Two-phase greedy algorithms for some classes of combinatorial linear programs. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 161\u2013166 (2008)"},{"issue":"5","key":"30_CR3","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1017\/S0963548309010001","volume":"18","author":"S. Felsner","year":"2009","unstructured":"Felsner, S., Knauer, K.: ULD-lattices and \u0394-bonds. Combinatorics, Probability and Computing\u00a018(5), 707\u2013724 (2009)","journal-title":"Combinatorics, Probability and Computing"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford Jr.","year":"1956","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics. Journal Canadien de Math\u00e9matiques\u00a08, 399\u2013404 (1956)","journal-title":"Canadian Journal of Mathematics. Journal Canadien de Math\u00e9matiques"},{"issue":"3, Ser. B","key":"30_CR5","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s101070050040","volume":"84","author":"A. Frank","year":"1999","unstructured":"Frank, A.: Increasing the rooted-connectivity of a digraph by one. Mathematical Programming\u00a084(3, Ser. B), 565\u2013576 (1999)","journal-title":"Mathematical Programming"},{"key":"30_CR6","unstructured":"Hoffman, A.J., Schwartz, D.E.: On lattice polyhedra. In: Hajnal, A., S\u00f3s, V.T. (eds.) Proceedings of the Fifth Hungerian Colloquium on Combinatorics. Colloquia mathematica Societatis J\u00e1nos Bolyai, vol.\u00a0I, vol.\u00a018, pp. 593\u2013598 (1978)"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0208012","volume":"8","author":"A. Itai","year":"1979","unstructured":"Itai, A., Shiloach, Y.: Maximum flow in planar networks. SIAM Journal on Computing\u00a08, 135 (1979)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"30_CR8","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1137\/0406038","volume":"6","author":"S. Khuller","year":"1993","unstructured":"Khuller, S., Naor, J., Klein, P.: The lattice structure of flow in planar graphs. SIAM Journal on Discrete Mathematics\u00a06(3), 477\u2013490 (1993)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"30_CR9","unstructured":"Klein, P.N.: Multiple-source shortest paths in planar graphs. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 146\u2013155 (2005)"},{"key":"30_CR10","unstructured":"Kornblum, D.F.: Greedy algorithms for some optimization problems on a lattice polyhedron. Ph.D. thesis, Graduate Center of the City University of New York (1978)"},{"issue":"271-283","key":"30_CR11","first-page":"79","volume":"15","author":"K. Kuratowski","year":"1930","unstructured":"Kuratowski, K.: Sur le probleme des courbes gauches en topologie. Fundamenta Mathematicae\u00a015(271-283), 79 (1930)","journal-title":"Fundamenta Mathematicae"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Matuschke, J.: Lattices and maximum flow algorithms in planar graphs. Diploma thesis, TU Berlin (2009)","DOI":"10.1007\/978-3-642-16926-7_30"},{"issue":"3","key":"30_CR13","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(\u2009\u2223\u2009V\u2009\u2223\u2009log\u2009\u2223\u2009V\u2009\u2223\u2009) time. Journal of Computer and System Sciences\u00a055(3), 454\u2013475 (1997)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"30_CR14","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","volume":"34","author":"H. Whitney","year":"1932","unstructured":"Whitney, H.: Non-separable and planar graphs. Transactions of the American Mathematical Society\u00a034(2), 339\u2013362 (1932)","journal-title":"Transactions of the American Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Graph Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16926-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T05:05:58Z","timestamp":1559797558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16926-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169250","9783642169267"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16926-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}