{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:59:28Z","timestamp":1774022368776,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1982,7,1]],"date-time":"1982-07-01T00:00:00Z","timestamp":394329600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1982,7]]},"DOI":"10.1016\/0020-0190(82)90022-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"233-235","source":"Crossref","is-referenced-by-count":79,"title":["Depth-first search and the vertex cover problem"],"prefix":"10.1016","volume":"14","author":[{"given":"Carla","family":"Savage","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(82)90022-9_BIB1","unstructured":"J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (North-Holland, New York)."},{"key":"10.1016\/0020-0190(82)90022-9_BIB2","first-page":"110","article-title":"An O(n2.5) algorithm for maximum matching in general graphs","author":"Even","year":"1975","journal-title":"Proc. 16th Annual IEEE Symp. on Foundations of Computer science"},{"key":"10.1016\/0020-0190(82)90022-9_BIB3","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability (Freeman, San Francisco)."},{"key":"10.1016\/0020-0190(82)90022-9_BIB4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n5\/ algorithm for maximum matching in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"issue":"4\/5","key":"10.1016\/0020-0190(82)90022-9_BIB5","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0020-0190(80)90140-4","article-title":"Maximum matchings and trees","volume":"10","author":"Savage","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(82)90022-9_BIB6","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082900229?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082900229?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:54:16Z","timestamp":1555073656000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019082900229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,7]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1982,7]]}},"alternative-id":["0020019082900229"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(82)90022-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1982,7]]}}}