{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,22]],"date-time":"2026-10-22T07:22:02Z","timestamp":1792653722173,"version":"4.5.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1981,8,1]],"date-time":"1981-08-01T00:00:00Z","timestamp":365472000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1981,8]]},"DOI":"10.1007\/bf00264533","type":"journal-article","created":{"date-parts":[[2004,9,27]],"date-time":"2004-09-27T21:41:25Z","timestamp":1096321285000},"page":"329-346","source":"Crossref","is-referenced-by-count":88,"title":["Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems"],"prefix":"10.1007","volume":"15","author":[{"suffix":"Jr.","given":"W.","family":"Lipski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F. P.","family":"Preparata","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF00264533_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. Reading, MA: Addison-Wesley, 1974"},{"key":"BF00264533_CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. System Sci. 13, 335\u2013379 (1976)","journal-title":"J. Comput. System Sci."},{"key":"BF00264533_CR3","first-page":"75","volume-title":"Proc. 16th Annual Symp. on Foundations of Comp. Sci.","author":"P. Emde Boas van","year":"1975","unstructured":"Emde Boas, P. van: Preserving order in a forest in less than logarithmic time. Proc. 16th Annual Symp. on Foundations of Comp. Sci., Univ. of California, Berkeley, Oct. 1975, pp. 75\u201384"},{"key":"BF00264533_CR4","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"Emde Boas, P. van: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Lett. 6, 80\u201382 (1977)","journal-title":"Information Processing Lett."},{"key":"BF00264533_CR5","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/S0021-9800(68)80039-0","volume":"4","author":"D. Gale","year":"1968","unstructured":"Gale, D.: Optimal assignments in an ordered set: an application of matroid theory. J. Combinatorial Theory 4, 176\u2013180 (1968)","journal-title":"J. Combinatorial Theory"},{"key":"BF00264533_CR6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(77)90068-0","volume":"6","author":"F. Gavril","year":"1977","unstructured":"Gavril, F.: Testing for equality between maximum matching and minimum node covering. Information Processing Lett. 6, 199\u2013202 (1977)","journal-title":"Information Processing Lett."},{"key":"BF00264533_CR7","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/nav.3800140304","volume":"14","author":"F. Glover","year":"1967","unstructured":"Glover, F.: Maximum matching in convex bipartite graph. Naval Res. Logist. Quart. 14, 313\u2013316 (1967)","journal-title":"Naval Res. Logist. Quart."},{"key":"BF00264533_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n 5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2, 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"BF00264533_CR9","volume-title":"Combinatorial Optimization: Networks and matroids","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and matroids. New York, NY: Holt, Rinehart and Winston, 1976"},{"key":"BF00264533_CR10","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(76)90023-2","volume":"3","author":"W. Lipski","year":"1976","unstructured":"Lipski, W.: Information storage and retrieval \u2014 mathematical foundations II (Combinatorial problems). Theor. Comput. Sci. 3, 183\u2013211 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"BF00264533_CR11","doi-asserted-by":"crossref","first-page":"227","DOI":"10.3233\/FI-1978-2115","volume":"2","author":"W. Lipski","year":"1977","unstructured":"Lipski, W., Lodi, E., Luccio, F., Mugnai, C., Pagli, L.: On two dimensional data organization II. Fundamenta Informaticae 2, 227\u2013243 (1977)","journal-title":"Fundamenta Informaticae"},{"key":"BF00264533_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. Assoc. Comput. Mach. 22, 215\u2013224 (1975)","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264533.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00264533\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264533","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264533.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,25]],"date-time":"2021-06-25T23:42:32Z","timestamp":1624664552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00264533"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,8]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,8]]}},"alternative-id":["BF00264533"],"URL":"https:\/\/doi.org\/10.1007\/bf00264533","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,8]]}}}