{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:47Z","timestamp":1759063667569},"reference-count":9,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"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":5099,"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":[[1999,8]]},"DOI":"10.1016\/s0304-3975(98)00180-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"163-169","source":"Crossref","is-referenced-by-count":15,"title":["Optimal path cover problem on block graphs"],"prefix":"10.1016","volume":"225","author":[{"given":"Wong","family":"Pak-Ken","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00180-7_BIB1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0020-0190(90)90064-5","article-title":"Linear algorithm for optimal path problem on interval graphs","volume":"35","author":"Arikati","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(98)00180-7_BIB2","series-title":"Graph Theory With Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0304-3975(98)00180-7_BIB3","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\/S0304-3975(98)00180-7_BIB4","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/S0304-3975(98)00180-7_BIB5","series-title":"Algorithmic Graph Theory","author":"Gibbon","year":"1985"},{"key":"10.1016\/S0304-3975(98)00180-7_BIB6","series-title":"Algorithmic Graph Theory And Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0304-3975(98)00180-7_BIB7","series-title":"Proc. 2nd Czechoslovakian Symp. on Graph Theory","article-title":"Path partitions for vertices and hamiltonity of graphs","author":"Skupien","year":"1974"},{"key":"10.1016\/S0304-3975(98)00180-7_BIB8","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0304-3975(93)90123-B","article-title":"Optimal path cover problem on block graphs and bipartite permutation graphs","volume":"115","author":"Srikant","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00180-7_BIB9","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0020-0190(94)00158-8","article-title":"The path-partition problem in block graphs","volume":"52","author":"Yan","year":"1994","journal-title":"Inform. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001807?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001807?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:21:47Z","timestamp":1555420907000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,8]]},"references-count":9,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,8]]}},"alternative-id":["S0304397598001807"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00180-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,8]]}}}