{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:14Z","timestamp":1725567074510},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_75","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"737-746","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Algorithms for Simplifying Flow Networks"],"prefix":"10.1007","author":[{"given":"Ewa","family":"Misio\u0142ek","sequence":"first","affiliation":[]},{"given":"Danny Z.","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"75_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"75_CR2","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"issue":"6","key":"75_CR3","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1137\/S0097539797317263","volume":"28","author":"S. Alstrup","year":"1999","unstructured":"Alstrup, S., Harel, D., Lauridsen, P., Thorup, M.: Dominators in linear time. SIAM Journal on Computing\u00a028(6), 2117\u20132132 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"75_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-44612-5_16","volume-title":"Mathematical Foundations of Computer Science 2000","author":"T.C. Biedl","year":"2000","unstructured":"Biedl, T.C., Brejov\u00e1, B., Vina\u0159, T.: Simplifying flow networks. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 202\u2013211. Springer, Heidelberg (2000)"},{"unstructured":"Brejov\u00e1, B., Vina\u0159, T.: Weihe\u2019s algorithm for maximum flow in planar graphs (project report), University of Waterloo, Course CS760K (1999)","key":"75_CR5"},{"key":"75_CR6","first-page":"1","volume":"4","author":"K. Cooper","year":"2001","unstructured":"Cooper, K., Harvey, T., Kennedy, K.: A simple, fast dominance algorithm. Softw. Pract. Exper.\u00a04, 1\u201310 (2001)","journal-title":"Softw. Pract. Exper."},{"key":"75_CR7","volume-title":"Introduction to Algorithms, McGraw-Hill","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, McGraw-Hill, 2nd edn. McGraw-Hill, New York (2001)","edition":"2"},{"key":"75_CR8","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"doi-asserted-by":"crossref","unstructured":"Goldberg, A.: Recent developments in maximum flow algorithms, Technical Report #98-045, NEC Research Institute (1998)","key":"75_CR9","DOI":"10.1007\/BFb0054350"},{"key":"75_CR10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.5486\/PMD.1966.13.1-4.15","volume":"13","author":"F. Harary","year":"1966","unstructured":"Harary, F., Prins, G.: The block-cutpoint-tree of a graph. Publ. Math. Debrecen\u00a013, 103\u2013107 (1966)","journal-title":"Publ. Math. Debrecen"},{"key":"75_CR11","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput.\u00a013, 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, and Winston (1976)","key":"75_CR12"},{"key":"75_CR13","volume-title":"Introduction to Algorithms, A Creative Approach","author":"U. Manber","year":"1989","unstructured":"Manber, U.: Introduction to Algorithms, A Creative Approach. Addison-Wesley, Reading (1989)"},{"issue":"6","key":"75_CR14","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding lowest common ancestors: Simplification and parallelization. SIAM Journal on Computing\u00a017(6), 1253\u20131262 (1988)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"75_CR15","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences\u00a026(3), 362\u2013391 (1983)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"75_CR16","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. Journal of Computer and System Sciences\u00a055(3), 454\u2013475 (1997)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_75","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T19:39:16Z","timestamp":1683229156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11533719_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}