{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T20:29:58Z","timestamp":1762979398169},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1984,10]]},"DOI":"10.1007\/bf01874391","type":"journal-article","created":{"date-parts":[[2005,7,2]],"date-time":"2005-07-02T18:31:47Z","timestamp":1120329107000},"page":"239-254","source":"Crossref","is-referenced-by-count":15,"title":["A probabilistic analysis of some greedy cardinality matching algorithms"],"prefix":"10.1007","volume":"1","author":[{"given":"G.","family":"Tinhofer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01874391_CR1","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, Path, trees and flowers, Can. J. Math. 17(1965)449.","journal-title":"Can. J. Math."},{"key":"BF01874391_CR2","first-page":"91","volume":"69","author":"C. Witzgall","year":"1965","unstructured":"C. Witzgall and C.T. Zahn, Jr., Modifications of Edmond's algorithm for maximum matching of graphs, J. Res. NBS 69b (April-June 1965)91.","journal-title":"J. Res. NBS"},{"key":"BF01874391_CR3","unstructured":"H. Gabow, An efficient implementation of Edmond's maximum matching algorithm, Techn. Rep. 31 (Stanford Univ. Comp. Sci. Dept., June 1972)."},{"key":"BF01874391_CR4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"1","author":"J.E. Hopcroft","year":"1973","unstructured":"J.E. Hopcroft and R. Karp, An 5\/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comp. 1(1973)225.","journal-title":"SIAM J. Comp."},{"key":"BF01874391_CR5","series-title":"Proc. 16th Ann. Symp. on Foundations of Computer Science","first-page":"100","volume-title":"An o(n 2.5)-algorithm for maximum matching in general graphs","author":"S. Even","year":"1975","unstructured":"S. Even and O. Kariv, An o(n 2.5)-algorithm for maximum matching in general graphs, Proc. 16th Ann. Symp. on Foundations of Computer Science (IEEE, New York, 1975)100."},{"key":"BF01874391_CR6","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. Lawler","year":"1976","unstructured":"E. Lawler, Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976)."},{"key":"BF01874391_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-51576-7","volume-title":"Solution Methods with FORTRAN-Programs","author":"R.E. Burkard","year":"1980","unstructured":"R.E. Burkard and U. Derigs, Assignment and matching problems, in: Solution Methods with FORTRAN-Programs (Springer, Berlin-Heidelberg-New York, 1980)."},{"key":"BF01874391_CR8","doi-asserted-by":"crossref","unstructured":"D. Angluin and L.G. Valiant. Fast probabilistic algorithms for Hamiltonian circuits and matchings, Proc. 9th ACM Symp. on Theory of Computing (1977).","DOI":"10.1145\/800105.803393"},{"key":"BF01874391_CR9","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0167-5060(08)70322-4","volume":"2","author":"D. Hausmann","year":"1978","unstructured":"D. Hausmann and B. Korte, An analysis of the greedy heuristic for independence systems, Ann. Disc. Math. 2(1978)65.","journal-title":"Ann. Disc. Math."},{"key":"BF01874391_CR10","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1017\/S0305004100053056","volume":"80","author":"B. Bollobas","year":"1976","unstructured":"B. Bollobas and P. Erd\u00f6s, Cliques in Random Graphs, Math. Proc. Camb. Phil. Soc. 80 (1976)419.","journal-title":"Math. Proc. Camb. Phil. Soc."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01874391.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01874391\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01874391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T14:56:45Z","timestamp":1557500205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01874391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["BF01874391"],"URL":"https:\/\/doi.org\/10.1007\/bf01874391","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,10]]}}}