{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T05:03:52Z","timestamp":1718946232885},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"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,10]]},"DOI":"10.1016\/0020-0190(89)90184-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:10:11Z","timestamp":1027642211000},"page":"29-33","source":"Crossref","is-referenced-by-count":38,"title":["Linear algorithm for domatic number problem on interval graphs"],"prefix":"10.1016","volume":"33","author":[{"given":"A.Srinavasa","family":"Rao","sequence":"first","affiliation":[]},{"given":"C.Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90184-1_BIB1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0020-0190(88)90173-1","article-title":"On the domatic number of interval graphs","volume":"28","author":"Bertossi","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(89)90184-1_BIB2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0166-218X(85)90025-3","article-title":"Dominating sets and domatic number of circular-arc graphs","volume":"12","author":"Bonuccelli","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(89)90184-1_BIB3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","article-title":"Domination, independent domination, and duality in strongly chordal graphs","volume":"7","author":"Farber","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(89)90184-1_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Gary","year":"1979"},{"key":"10.1016\/0020-0190(89)90184-1_BIB5","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(89)90184-1_BIB6","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":"Ramalingan","year":"1988","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089901841?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089901841?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:57:42Z","timestamp":1555073862000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089901841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0020019089901841"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90184-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}