{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T15:24:30Z","timestamp":1764602670347},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"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":[[1990,7]]},"DOI":"10.1016\/0020-0190(90)90064-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:10:11Z","timestamp":1027642211000},"page":"149-153","source":"Crossref","is-referenced-by-count":75,"title":["Linear algorithm for optimal path cover problem on interval graphs"],"prefix":"10.1016","volume":"35","author":[{"given":"Srinivasa","family":"Rao Arikati","sequence":"first","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90064-5_BIB1","series-title":"Graph Theory and Combinatorics","first-page":"201","article-title":"On covering the points of a graph with point disjoint paths","author":"Boesch","year":"1974"},{"key":"10.1016\/0020-0190(90)90064-5_BIB2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0020-0190(79)90011-5","article-title":"Minimum node disjoint path covering for circular-arc graphs","volume":"8","author":"Bonuccelli","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(90)90064-5_BIB3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graph and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(90)90064-5_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(90)90064-5_BIB5","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0020-0190(90)90064-5_BIB6","series-title":"Graph Theory and Combinatorics","first-page":"262","article-title":"On hamiltonian completion problem","author":"Goodman","year":"1974"},{"key":"10.1016\/0020-0190(90)90064-5_BIB7","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1145\/321892.321897","article-title":"Advances on hamiltonian completion problem","volume":"22","author":"Goodman","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(90)90064-5_BIB8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(85)90050-X","article-title":"Finding hamiltonian circuits in interval graphs","volume":"20","author":"Keil","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(90)90064-5_BIB9","doi-asserted-by":"crossref","unstructured":"G.K. Manacher and T.A. Mankus, An optimum O(n log n) algorithm for finding a canonical hamiltonian path and a canonical hamiltonian circuit in a set of intervals, Inform. Process. Lett., to appear.","DOI":"10.1016\/0020-0190(90)90025-S"},{"key":"10.1016\/0020-0190(90)90064-5_BIB10","series-title":"Tech. Rept.","article-title":"Optimal covering of cacti by vertex-disjoint paths","author":"Moran","year":"1988"},{"key":"10.1016\/0020-0190(90)90064-5_BIB11","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0020-0190(88)90091-9","article-title":"A unified approach to domination problems on interval graphs","volume":"27","author":"Ramalingam","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(90)90064-5_BIB12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0020-0190(89)90184-1","article-title":"Linear algorithm for domatic number problem on interval graphs","volume":"33","author":"Srinivasa Rao","year":"1989","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019090900645?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019090900645?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:20:32Z","timestamp":1555075232000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019090900645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,7]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,7]]}},"alternative-id":["0020019090900645"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90064-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,7]]}}}