{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:29Z","timestamp":1759638509061},"reference-count":16,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"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":[[1986,4]]},"DOI":"10.1016\/0020-0190(86)90022-0","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"171-174","source":"Crossref","is-referenced-by-count":40,"title":["Total domination in interval graphs"],"prefix":"10.1016","volume":"22","author":[{"given":"J.Mark","family":"Keil","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90022-0_BIB1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0211015","article-title":"Dominating sets in chordal graphs","volume":"11","author":"Booth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(86)90022-0_BIB2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(86)90022-0_BIB3","unstructured":"D.G. Corneil and J.M. Keil, A dynamic programming approach to the dominating set problem on k-trees, Submitted for publication."},{"key":"10.1016\/0020-0190(86)90022-0_BIB4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","article-title":"Clustering and domination in perfect graphs","volume":"9","author":"Corneil","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(86)90022-0_BIB5","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(86)90022-0_BIB6","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(85)90001-X","article-title":"Domination in permutation graphs","volume":"6","author":"Farber","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(86)90022-0_BIB7","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of comparability graphs and of interval graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Canad. J. Math."},{"key":"10.1016\/0020-0190(86)90022-0_BIB8","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"issue":"4","key":"10.1016\/0020-0190(86)90022-0_BIB9","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(86)90022-0_BIB10","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0166-218X(83)90003-3","article-title":"A linear algorithm for the domination number of a series-parallel graph","volume":"5","author":"Kikuno","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(86)90022-0_BIB11","article-title":"Domination and irredundance in split graphs","author":"Laskar","year":"1983"},{"key":"10.1016\/0020-0190(86)90022-0_BIB12","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1137\/0605040","article-title":"On the algorithmic complexity of total domination","volume":"5","author":"Laskar","year":"1984","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0020-0190(86)90022-0_BIB13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","article-title":"Representation of a finite graph by a set of intervals on the real line","volume":"51","author":"Lekkerkerker","year":"1962","journal-title":"Fundamenta Mathematicae"},{"key":"10.1016\/0020-0190(86)90022-0_BIB14","article-title":"NP-completeness of total and connected domination, and irredundance for bipartite graphs","author":"Pfaff","year":"1983"},{"key":"10.1016\/0020-0190(86)90022-0_BIB15","article-title":"Linear algorithms for independent domination and total domination in series-parallel graphs","author":"Pfaff","year":"1984"},{"key":"10.1016\/0020-0190(86)90022-0_BIB16","unstructured":"L.K. Stewart, Ph.D. Thesis, Dept. of Computer Science, Univ. of Toronto, Personal communication."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900220?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900220?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T05:29:29Z","timestamp":1553578169000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["0020019086900220"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90022-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}