{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T17:17:03Z","timestamp":1771262223020,"version":"3.50.1"},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540528261","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032060","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"586-597","source":"Crossref","is-referenced-by-count":29,"title":["A new approach to maximum matching in general graphs"],"prefix":"10.1007","author":[{"given":"Norbert","family":"Blum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","unstructured":"Aho A. V., Hopcroft J. E, Ullman J. D: The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974, 187\u2013189."},{"key":"44_CR2","first-page":"585","volume-title":"Combinatorial Mathematics and its Applications","author":"M. L. Balinski","year":"1969","unstructured":"Balinski M. L.: Labelling to Obtain a Maximum Matching, in Combinatorial Mathematics and its Applications (R. C. Bose and T. A. Dowling, eds.), University of North Carolina Press, Chapel Hill, 1969, 585\u2013602."},{"key":"44_CR3","unstructured":"Bartnik G.W.: Algorithmes de couplages dans les graphes, Th\u00e9se Doctorat 3e cycle, Universit\u00e9 Paris VI,1978."},{"key":"44_CR4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C. Berge","year":"1957","unstructured":"Berge C.: Two Theorems in Graph Theory, Proc. Nat. Acad. Sci. U.S.A., 43 (1957), 449\u2013844.","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"44_CR5","unstructured":"Blum N.: A New Approach to Maximum Matching in General Graphs, Report No. 8546-CS, Institut f\u00fcr Informatik der Universit\u00e4t Bonn, Mai 1990."},{"key":"44_CR6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds J.: Paths, Trees and Flowers, Canad. J. Math, 17 (1965), 449\u2013467.","journal-title":"Canad. J. Math"},{"key":"44_CR7","first-page":"100","volume":"16","author":"S Even","year":"1975","unstructured":"Even S, Kariv O.: An O(n 2.5) Algorithm for Maximum Matching in General Graphs, FOCS, 16 (1975), 100\u2013112.","journal-title":"FOCS"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Gabow H. N.: An Efficient Implementation of Edmond's Algorithm for Maximum Matching on Graph, J. ACM, 1976, 221\u2013234.","DOI":"10.1145\/321941.321942"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Gabow H. N., Tarjan R. E.: A Linear-time Algorithm for a Special Case of Disjoint Set Union, J. Comput. Syst. Sci., 1985, 209\u2013221.","DOI":"10.1016\/0022-0000(85)90014-5"},{"key":"44_CR10","doi-asserted-by":"crossref","unstructured":"Galil Z.: Efficient Algorithms for Finding Maximum Matching in Graphs, Computing Surveys, 1986, 23\u201338.","DOI":"10.1145\/6462.6502"},{"key":"44_CR11","unstructured":"Gondran M., Minoux M.: Graphs and Algorithms, Wiley & Sons, 1984, 283\u2013284."},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Hopcroft J. E., Karp R. M.: An n 5\/2 Algorithm for Maximum Matching in Bipartite Graphs, SIAM J. Comput., 1973, 225\u2013231.","DOI":"10.1137\/0202019"},{"key":"44_CR13","volume-title":"An O(n2.5) Algorithm for Maximum Matching in General Graphs","author":"O. Kariv","year":"1976","unstructured":"Kariv O.: An O(n 2.5) Algorithm for Maximum Matching in General Graphs, Ph.D. thesis, Dept. of Applied Mathematics, Weizmann Institute of Science, Rehovort, Israel, 1976."},{"key":"44_CR14","unstructured":"Lawler E.: Combinatorial Optimization, Networks and Matroids, Holt, Rinehart and Winston, 1976."},{"key":"44_CR15","first-page":"12","volume":"21","author":"S. Micali","year":"1980","unstructured":"Micali S., Vazirani V. V.: An O(\u221a|V| \u00b7 |E|) Algorithm for Finding Maximum Matching in General Graphs, FOCS, 21 (1980), 12\u201327.","journal-title":"FOCS"},{"key":"44_CR16","unstructured":"Papadimitriou C. H., Steiglitz K.: Combinatorial Optimization, Algorithms and Complexity, Prentice-Hall, 1982."},{"key":"44_CR17","doi-asserted-by":"crossref","unstructured":"Peterson P. A., Loui M. C.: The General Matching Algorithm of Micali and Vazirani, Algorithmica, 1988, 511\u2013533.","DOI":"10.1007\/BF01762129"},{"key":"44_CR18","doi-asserted-by":"crossref","unstructured":"Tarjan J. E.: Data Structures and Network Algorithms, SIAM, 1983.","DOI":"10.1137\/1.9781611970265"},{"key":"44_CR19","unstructured":"Vazirani V. V.: A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(\u221aV E) General Graph Matching Algorithm, TR 89-1035, Dept. of Computer Science, Cornell University, Sept. 1989."},{"key":"44_CR20","doi-asserted-by":"crossref","first-page":"91","DOI":"10.6028\/jres.069B.009","volume":"69 B","author":"C. Witzgall","year":"1965","unstructured":"Witzgall C., Zahn C. T. Jr.: Modification of Edmond's Maximum Matching Algorithm, J. Res. Nat. Bur. Standards, 69 B (1965), 91\u201398.","journal-title":"J. Res. Nat. Bur. Standards"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032060.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:05:36Z","timestamp":1607551536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0032060","relation":{},"subject":[]}}