{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:51Z","timestamp":1725664251271},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603139"},{"type":"electronic","value":"9783540449133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60313-1_141","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:15:51Z","timestamp":1330262151000},"page":"155-170","source":"Crossref","is-referenced-by-count":3,"title":["Maximum skew-symmetric flows"],"prefix":"10.1007","author":[{"given":"Andrew V.","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander V.","family":"Karzanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"12_CR1","volume-title":"Flow Algorithms","author":"G. M. Adel'son-Vel'ski","year":"1975","unstructured":"G. M. Adel'son-Vel'ski, E. A. Dinits, and A. V. Karzanov. Flow Algorithms Nauka, Moscow, 1975. In Russian."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1137\/0218065","volume":"18","author":"R. K. Ahuja","year":"1989","unstructured":"R. K. Ahuja, J. B. Orlin, and R. E. Tarjan. Improved Time Bounds for the Maximum Flow Problem. SIAM J. Comput., 18:939\u2013954, 1989.","journal-title":"SIAM J. Comput."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"N. Blum. A New Approach to Maximum Matching in General Graphs. In Proc. ICALP, pages 586\u2013597, 1990.","DOI":"10.1007\/BFb0032060"},{"key":"12_CR4","unstructured":"N. Blum. A New Approach to Maximum Matching in General Graphs. Technical report, Institut f\u00fcr Informatik der Universit\u00e4t Bonn, 1990."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"J. Cheriyan, T. Hagerup, and K. Mehlhorn. Can a Maximum Flow be Computed in o(nm) Time? In Proc. ICALP, 1990.","DOI":"10.1007\/BFb0032035"},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D. D. Sleator","year":"1985","unstructured":"D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. J. Assoc. Comput. Mach., 32:652\u2013686, 1985.","journal-title":"J. Assoc. Comput. Mach."},{"key":"12_CR7","first-page":"1277","volume":"11","author":"E. A. Dinic","year":"1970","unstructured":"E. A. Dinic. Algorithm for Solution of a Problem of Maximum Flow in Networks with Power Estimation. Soviet Math. Dokl., 11:1277\u20131280, 1970.","journal-title":"Soviet Math. Dokl."},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds. Paths, Trees and Flowers. Canada J. Math., 17:449\u2013467, 1965.","journal-title":"Canada J. Math."},{"key":"12_CR9","unstructured":"J. Edmonds and E. L. Johnson. Matching, a Well-Solved Class of Integer Linear Programs. In R. Guy, H. Haneni, and J. Sch\u00f6nhein, editors, Combinatorial Structures and Their Applications, pages 89\u201392. Gordon and Breach, NY, 1970."},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds and R. M. Karp. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. J. Assoc. Comput. Mach., 19:248\u2013264, 1972.","journal-title":"J. Assoc. Comput. Mach."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1137\/0204043","volume":"4","author":"S. Even","year":"1975","unstructured":"S. Even and R. E. Tarjan. Network Flow and Testing Graph Connectivity. SIAM J. Comput., 4:507\u2013518, 1975.","journal-title":"SIAM J. Comput."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"T. Feder and R. Motwani. Clique Partitions, Graph Compression and Speeding-up Algorithms. In Proc. 23st Annual ACM Symposium on Theory of Computing, pages 123\u2013133, 1991.","DOI":"10.1145\/103418.103424"},{"key":"12_CR13","volume-title":"Flows in Networks","author":"L. R. Ford Jr.","year":"1962","unstructured":"L. R. Ford, Jr. and D. R. Fulkerson. Flows in Networks. Princeton Univ. Press, Princeton, NJ, 1962."},{"key":"12_CR14","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1145\/115234.115366","volume":"38","author":"H. N. Gabow","year":"1991","unstructured":"H. N. Gabow and R. E. Tarjan. Faster scaling algorithms for general graphmatching problems. J. Assoc. Comput. Mach., 38:815\u2013853, 1991.","journal-title":"J. Assoc. Comput. Mach."},{"key":"12_CR15","unstructured":"A. V. Goldberg and A. V. Karzanov. Path Problems in Skew-Symmetric Graphs. Technical Report STAN-CS-93-1489, Department of Computer Science, Stanford University, 1993."},{"key":"12_CR16","unstructured":"A. V. Goldberg and A. V. Karzanov. Path Problems in Skew-Symmetric Graphs. In Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, pages 526\u2013535, 1994."},{"key":"12_CR17","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A. V. Goldberg","year":"1988","unstructured":"A. V. Goldberg and R. E. Tarjan. A New Approach to the Maximum Flow Problem. J. Assoc. Comput. Mach., 35:921\u2013940, 1988.","journal-title":"J. Assoc. Comput. Mach."},{"key":"12_CR18","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"15","author":"A. V. Goldberg","year":"1990","unstructured":"A. V. Goldberg and R. E. Tarjan. Finding Minimum-Cost Circulations by Successive Approximation. Math. of Oper. Res., 15:430\u2013466, 1990.","journal-title":"Math. of Oper. Res."},{"key":"12_CR19","volume-title":"Matematicheskie Voprosy Upravleniya Proizvodstvom, volume 5","author":"A. V. Karzanov","year":"1973","unstructured":"A. V. Karzanov. O nakhozhdenii maksimal'nogo potoka v setyakh spetsial'nogo vida i nekotorykh prilozheniyakh. In Matematicheskie Voprosy Upravleniya Proizvodstvom, volume 5. Moscow State University Press, Moscow, 1973. In Russian; title translation: On Finding Maximum Flows in Network with Special Structure and Some Applications."},{"key":"12_CR20","first-page":"66","volume-title":"Problems in Cibernetics, volume 5","author":"A. V. Karzanov","year":"1973","unstructured":"A. V. Karzanov. Tochnaya otzenka algoritma nakhojdeniya maksimalnogo potoka, primenennogo k zadache \u201co predstavitelyakh\u201d. In Problems in Cibernetics, volume 5, pages 66\u201370. Nauka, Moscow, 1973. In Russian; title translation: The exact time bound for a maximum flow algorithm applied to the set representatives problem."},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1006\/jagm.1994.1044","volume":"17","author":"V. King","year":"1994","unstructured":"V. King, S. Rao, and R. Tarjan. A Faster Deterministic Maximum Flow Algorithm. J. Algorithms, 17:447\u2013474, 1994.","journal-title":"J. Algorithms"},{"key":"12_CR22","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. L. Lawler","year":"1976","unstructured":"E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Reinhart, and Winston, New York, NY., 1976."},{"key":"12_CR23","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz and M. D. Plummer. Matching Theory. Akad\u00e9miai Kiad\u00f3, Budapest, 1986."},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"S. Micali and V. V. Vazirani. An O(\u221a\u00a6V\u2225E\u00a6) algorithm for finding maximum matching in general graphs. In Proc. 21th IEEE Annual Symposium on Foundations of Computer Science, pages 17\u201327, 1980.","DOI":"10.1109\/SFCS.1980.12"},{"key":"12_CR25","unstructured":"V. V. Vazirani. A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(\u221aVE) General Graph Maximum Matching Algorithm. Combinatorica, to appear."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60313-1_141.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:58:03Z","timestamp":1605628683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60313-1_141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603139","9783540449133"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-60313-1_141","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}