{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:13:31Z","timestamp":1648584811468},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"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":[[1989,2]]},"DOI":"10.1016\/0020-0190(89)90129-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:10:11Z","timestamp":1027642211000},"page":"119-125","source":"Crossref","is-referenced-by-count":7,"title":["Shortest enclosing walks and cycles in embedded graphs"],"prefix":"10.1016","volume":"30","author":[{"given":"J.Scott","family":"Provan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90129-4_BIB1","series-title":"Complex Analysis","author":"Alfors","year":"1966"},{"key":"10.1016\/0020-0190(89)90129-4_BIB2","article-title":"Optimal enclosing regions in planar graphs","author":"Bienstock","year":"1987","journal-title":"Networks"},{"key":"10.1016\/0020-0190(89)90129-4_BIB3","doi-asserted-by":"crossref","unstructured":"S. Cook, The complexity of theorem-proving procedures, Proc. 3rd Ann. ACM Symp. Theory of Computing Association for Computing Machinery, New York, pp. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"10.1016\/0020-0190(89)90129-4_BIB4","doi-asserted-by":"crossref","unstructured":"M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in network optimization algorithms, Proc. 25th Ann. Symp. Foundations of Computer Science, IEEE Computer Society, Long Beach, CA, pp. 338\u2013346.","DOI":"10.1109\/SFCS.1984.715934"},{"key":"10.1016\/0020-0190(89)90129-4_BIB5","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 Engng"},{"key":"10.1016\/0020-0190(89)90129-4_BIB6","series-title":"Lectures on Algebraic Topology","author":"Greenberg","year":"1971"},{"key":"10.1016\/0020-0190(89)90129-4_BIB7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230180108","article-title":"Convexity and the Steiner tree problem","volume":"18","author":"Provan","year":"1988","journal-title":"Networks"},{"key":"10.1016\/0020-0190(89)90129-4_BIB8","doi-asserted-by":"crossref","unstructured":"J.S. Provan, An approximation scheme for finding Steiner trees with obstacles, SIAM J. Comput. to appear.","DOI":"10.1137\/0217057"},{"key":"10.1016\/0020-0190(89)90129-4_BIB9","series-title":"Proc. 10th Ann. ACM Symp. Theory of Computing","first-page":"216","article-title":"The complexity of satisfiability problems,","author":"Schaefer","year":"1978"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089901294?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089901294?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:55:35Z","timestamp":1555073735000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089901294"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["0020019089901294"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90129-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,2]]}}}