{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T22:50:20Z","timestamp":1752101420413},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10424,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1985,1]]},"DOI":"10.1016\/0166-218x(85)90057-5","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"27-45","source":"Crossref","is-referenced-by-count":17,"title":["Solving NP-hard problems in \u2018almost trees\u2019: Vertex cover"],"prefix":"10.1016","volume":"10","author":[{"given":"Don","family":"Coppersmith","sequence":"first","affiliation":[]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(85)90057-5_BIB1","series-title":"Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(85)90057-5_BIB2","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1145\/828.322439","article-title":"Solving NP-hard problems on graphs that are almost trees and an application to facility location problems","volume":"31","author":"Gurevich","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(85)90057-5_BIB3","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","article-title":"Applying parallel computation in the design of serial algorithms","volume":"30","author":"Megiddo","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(85)90057-5_BIB4","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."},{"key":"10.1016\/0166-218X(85)90057-5_BIB5","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1137\/0206038","article-title":"Finding a maximum independent set","volume":"6","author":"Tarjan","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(85)90057-5_BIB6","unstructured":"R.E. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, TR-69, Dept. of Comp. Sci., Courant Inst., New York Univ., 251 Mercer St., NY 10012, to appear in SIAM J. Comput."},{"key":"10.1016\/0166-218X(85)90057-5_BIB7","unstructured":"U. Vishkin, Synchronous parallel computation \u2014 a survey, TR-71, Dept. of Comp. Sci., Courant Inst., New York Univ., 251 Mercer St., NY 10012."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900575?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900575?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T14:51:12Z","timestamp":1554907872000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X85900575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["0166218X85900575"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(85)90057-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}