{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T09:05:40Z","timestamp":1712307940746},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"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":10516,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1984,10]]},"DOI":"10.1016\/0022-0000(84)90032-1","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"225-242","source":"Crossref","is-referenced-by-count":3,"title":["On the computational complexity of path cover problems"],"prefix":"10.1016","volume":"29","author":[{"given":"Simeon","family":"Ntafos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teofilo","family":"Gonzalez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90032-1_BIB1","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1109\/TSE.1979.234213","article-title":"On path cover problems in digraphs and applications to program testing","volume":"SE-5","author":"Ntafos","year":"1979","journal-title":"IEEE Trans. Software Engrg."},{"issue":"No. 1","key":"10.1016\/0022-0000(84)90032-1_BIB2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Ann. of Math. (2)"},{"key":"10.1016\/0022-0000(84)90032-1_BIB3","series-title":"Combinatorial Algorithms","author":"Nijenhuis","year":"1975"},{"key":"10.1016\/0022-0000(84)90032-1_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1978"},{"issue":"No. 1","key":"10.1016\/0022-0000(84)90032-1_BIB5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/TC.1981.6312158","article-title":"On structured digraphs and program testing","volume":"C-30","author":"Ntafos","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0022-0000(84)90032-1_BIB6","series-title":"Proceedings, 1973 IEEE Sympos. on Computer Software Reliability","first-page":"18","article-title":"Optimal software test planing through automated network analysis","author":"Krause","year":"1973"},{"key":"10.1016\/0022-0000(84)90032-1_BIB7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1109\/TSE.1976.233819","article-title":"On two problems in the generation of program test paths","volume":"SE-2","author":"Gabow","year":"1976","journal-title":"IEEE Trans. Software Engrg."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900321?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900321?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:51:45Z","timestamp":1550325105000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["0022000084900321"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90032-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,10]]}}}