{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T06:34:21Z","timestamp":1722062061009},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1986,12]]},"DOI":"10.1007\/bf02579264","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T22:20:50Z","timestamp":1174602050000},"page":"387-391","source":"Crossref","is-referenced-by-count":29,"title":["A las vegas rnc algorithm for maximum matching"],"prefix":"10.1007","volume":"6","author":[{"given":"Howard J.","family":"Karloff","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579264_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, Paths, Trees, and Flowers,Canadian J. Math. 17 (1965), 449\u2013467.","journal-title":"Canadian J. Math."},{"key":"BF02579264_CR2","unstructured":"Z. Galil andV. Pan, Fast and Efficient Randomized Parallel Computation of a Perfect Matching in a Graph,to appear in Proc. of the Twenty-Sixth Annual Symp. on the Foundations of Computer Science, 1985."},{"key":"BF02579264_CR3","doi-asserted-by":"crossref","unstructured":"R. M. Karp, E. Upfal andA. Wigderson, Constructing a perfect matching is in random NC,Combinatorica 6 (1986).","DOI":"10.1007\/BF02579407"},{"key":"BF02579264_CR4","doi-asserted-by":"crossref","unstructured":"R. M. Karp andA. Wigderson, A Fast Parallel Algorithm for the Maximal Independent Set Problem,Proc. of the Sixteenth Ann. ACM Symp. on Theory of Computing (1984), 266\u2013272.","DOI":"10.1145\/800057.808690"},{"key":"BF02579264_CR5","unstructured":"L. Lov\u00e1sz,private communication."},{"key":"BF02579264_CR6","volume-title":"Combinatorial Problems and Exercises","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz,Combinatorial Problems and Exercises, North-Holland, New York, 1979."},{"key":"BF02579264_CR7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01889914","volume":"23","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz, On the Structure of Factorizable Graphs,Acta Mathematica Academiae Scientiarum Hungaricae,23 (1972), 179\u2013195.","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"key":"BF02579264_CR8","doi-asserted-by":"crossref","unstructured":"M. Luby, A Simple Parallel Algorithm for the Maximal Independent Set Problem,Proc. of the Seventeenth Ann. ACM Symp. on Theory of Computing (1985), 1\u201310.","DOI":"10.1145\/22145.22146"},{"key":"BF02579264_CR9","volume-title":"Mathematical Programming the state of the Art (Bonn 1982)","author":"A. Schrijver","year":"1983","unstructured":"A. Schrijver, Min-max results in combinatorial optimization,in: Mathematical Programming the state of the Art (Bonn 1982), (ed: A. Bachem, M. Gr\u00f6tschel, B. Korte), Springer-Verlag, New York, 1983."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579264.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579264\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:45:00Z","timestamp":1558197900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["BF02579264"],"URL":"https:\/\/doi.org\/10.1007\/bf02579264","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,12]]}}}