{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T00:03:53Z","timestamp":1648944233766},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1979,4,1]],"date-time":"1979-04-01T00:00:00Z","timestamp":291772800000},"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":[[1979,4]]},"DOI":"10.1016\/0020-0190(79)90011-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"159-161","source":"Crossref","is-referenced-by-count":23,"title":["Minimum node disjoint path covering for circular-arc graphs"],"prefix":"10.1016","volume":"8","author":[{"given":"M.A.","family":"Bonuccelli","sequence":"first","affiliation":[]},{"given":"D.P.","family":"Bovet","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(79)90011-5_bib1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1976"},{"issue":"2","key":"10.1016\/0020-0190(79)90011-5_bib2","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":"JACM"},{"issue":"7","key":"10.1016\/0020-0190(79)90011-5_bib3","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/359545.359553","article-title":"On the complexity of computing the measure of\u222a[ai, bi]","volume":"21","author":"Fredman","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(79)90011-5_bib4","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, (Freeman, San Francisco, CA) to appear."},{"key":"10.1016\/0020-0190(79)90011-5_bib5","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230040407","article-title":"Algorithms on circular-arc graphs","volume":"4","author":"Gavril","year":"1974","journal-title":"Networks"},{"issue":"4","key":"10.1016\/0020-0190(79)90011-5_bib6","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/356707.356711","article-title":"A survey of analysis techniques for discrete algorithms","volume":"9","author":"Weide","year":"1977","journal-title":"Comput. Surveys"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900115?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900115?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:29:04Z","timestamp":1555086544000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079900115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,4]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1979,4]]}},"alternative-id":["0020019079900115"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90011-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,4]]}}}