{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:40Z","timestamp":1725483760951},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_15","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:28:20Z","timestamp":1178371700000},"page":"192-201","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Simplifying Flow Networks"],"prefix":"10.1007","author":[{"given":"Therese C.","family":"Biedl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bro\u0148a","family":"Brejov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Vina\u0159","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"15_CR1","unstructured":"Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, 1993."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Therese Biedl, Bro\u0148a Brejov\u00e1, and Tom\u00e1\u0161 Vina\u0159. Simplifying flow networks. Technical Report CS-2000-07, Department of Computer Science, University of Waterloo, 2000.","DOI":"10.1007\/3-540-44612-5_15"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Steven Fortune, John Hopcroft, and James Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10(2):111\u2013121, February 1980.","DOI":"10.1016\/0304-3975(80)90009-2"},{"key":"15_CR4","first-page":"898","volume-title":"Proceedings of the 20th Annual Allerton Conference on Communication, Control, and Computing","author":"D. B. Johnson","year":"1982","unstructured":"Donald B. Johnson and Shankar M. Venkatesan. Using divide and conquer to find flows in directed planar networks in O(n3\/2 log n) time. In Proceedings of the 20th Annual Allerton Conference on Communication, Control, and Computing, pages 898\u2013905, University of Illinois, Urbana-Champaign, 1982."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Samir Khuller, Joseph Naor, and Philip Klein. The lattice structure of flow in planar graphs. SIAM Journal on Discrete Mathematics, 6(3):477\u2013490, August 1993.","DOI":"10.1137\/0406038"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Franco P. Preparata and Micheal I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"issue":"4","key":"15_CR7","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1137\/S0097539792224061","volume":"23","author":"Alexander Schrijver","year":"1994","unstructured":"Alexander Schrijver. Finding k disjoint paths in a directed planar graph. SIAM Journal of Computing, 23(4):780\u2013788, August 1994.","journal-title":"SIAM Journal of Computing"},{"issue":"3","key":"15_CR8","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D. Daniel","year":"1983","unstructured":"Daniel D. Sleator and Robert E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3):362\u2013391, June 1983.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"15_CR9","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1006\/jcss.1997.1538","volume":"55","author":"Karsten Weihe","year":"1997","unstructured":"Karsten Weihe. Maximum (s, t)-flows in planar networks in O(\u00a6V\u00a6 log \u00a6V\u00a6) time. Journal of Computer and System Sciences, 55(3):454\u2013475, December 1997.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:11:39Z","timestamp":1558271499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"1 June 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}