{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T03:11:37Z","timestamp":1785467497126,"version":"3.56.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"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":8052,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,7]]},"DOI":"10.1016\/0304-3975(91)90159-y","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"179-197","source":"Crossref","is-referenced-by-count":22,"title":["Optimal covering of cacti by vertex-disjoint paths"],"prefix":"10.1016","volume":"84","author":[{"given":"Shlomo","family":"Moran","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yaron","family":"Wolfstahl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90159-Y_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0304-3975(91)90159-Y_BIB2","first-page":"201","article-title":"On covering the points of a graph with point disjoint paths","author":"Boesch","year":"1974","journal-title":"Proc. 1973 Capital Conf. on Graph Theory and Combinatorics"},{"issue":"2","key":"10.1016\/0304-3975(91)90159-Y_BIB3","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1145\/322003.322005","article-title":"Covering the points of a digraph with point-disjoint paths and its application to code optimization","volume":"24","author":"Boesch","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90159-Y_BIB4","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0304-3975(91)90159-Y_BIB5","first-page":"263","article-title":"On the Hamiltonian completion problem","author":"Goodman","year":"1974","journal-title":"Proc. 1973 Capital Conf. on Graph Theory and Combinatorics"},{"key":"10.1016\/0304-3975(91)90159-Y_BIB6","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","article-title":"The planar Hamiltonian circuit problem is NP-complete","volume":"5","author":"Garey","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90159-Y_BIB7","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","article-title":"Algorithm 447: efficient algorithms for graph manipulation","volume":"16","author":"Hopcroft","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(91)90159-Y_BIB8","series-title":"Applied Graph Theory","author":"Marshall","year":"1971"},{"key":"10.1016\/0304-3975(91)90159-Y_BIB9","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01408172","article-title":"On mapping processes to processors","volume":"16","author":"Pinter","year":"1987","journal-title":"Internat. J. Parallel Programming"},{"key":"10.1016\/0304-3975(91)90159-Y_BIB10","series-title":"Computer Networks","author":"Tanenbaum","year":"1981"},{"key":"10.1016\/0304-3975(91)90159-Y_BIB11","series-title":"Graphs, Groups and Surfaces","author":"White","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190159Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190159Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:33Z","timestamp":1555127673000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190159Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["030439759190159Y"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90159-y","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}