{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T11:34:35Z","timestamp":1771673675141,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1016\/0167-6377(82)90015-3","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:41:01Z","timestamp":1056998461000},"page":"134-138","source":"Crossref","is-referenced-by-count":79,"title":["Independent domination in chordal graphs"],"prefix":"10.1016","volume":"1","author":[{"given":"Martin","family":"Farber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(82)90015-3_BIB1","series-title":"Proc. 8th Southeastern Conference on Combinatorics, Graph Theory, and Computing","first-page":"321","article-title":"Independent domination in trees","author":"Beyer","year":"1977"},{"key":"10.1016\/0167-6377(82)90015-3_BIB2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/jgt.3190030306","article-title":"Graph-theoretic parameters concerning domination, independence, and irredundance","volume":"3","author":"Bollob\u00e1s","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/0167-6377(82)90015-3_BIB3","series-title":"Dominating sets in chordal graphs","author":"Booth","year":"1980"},{"key":"10.1016\/0167-6377(82)90015-3_BIB4","unstructured":"G. Chang, Personal communication (1982) (to be included in his Ph.D. thesis, School of Operations Research and Industrial Engineering, Cornell University)."},{"key":"10.1016\/0167-6377(82)90015-3_BIB5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(75)90011-3","article-title":"A linear algorithm for the domination number of a tree","volume":"4","author":"Cockayne","year":"1975","journal-title":"Information Processing Lett."},{"key":"10.1016\/0167-6377(82)90015-3_BIB6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230070305","article-title":"Towards a theory of domination in graphs","volume":"7","author":"Cockayne","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0167-6377(82)90015-3_BIB7","series-title":"Proc. 12th Southeastern Conference on Combinatorics, Graph Theory, and Computing","article-title":"Domination and duality in weighted trees","author":"Farber","year":"1982"},{"key":"10.1016\/0167-6377(82)90015-3_BIB8_1","article-title":"Application of 1.p duality to problem involving independence and domination","author":"Farber","year":"1982"},{"key":"10.1016\/0167-6377(82)90015-3_BIB8_2","series-title":"Technical Report 81-13","article-title":"Application of 1.p duality to problem involving independence and domination","author":"Farber","year":"1981"},{"key":"10.1016\/0167-6377(82)90015-3_BIB9","doi-asserted-by":"crossref","unstructured":"M. Farber, \u201cDomination, independent domination, and duality in strongly chordal graphs\u201d Discrete Appl. Math., submitted.","DOI":"10.1016\/0166-218X(84)90061-1"},{"key":"10.1016\/0167-6377(82)90015-3_BIB10","series-title":"Proc. 5th British Combinatorial Conference","first-page":"211","article-title":"Some polynomial algorithms for certain graphs and hypergraphs","author":"Frank","year":"1975"},{"key":"10.1016\/0167-6377(82)90015-3_BIB11","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0167-6377(82)90015-3_BIB12","first-page":"639","article-title":"Strong independence in graphs","volume":"29","author":"McFall","year":"1980"},{"key":"10.1016\/0167-6377(82)90015-3_BIB13","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0020-0190(78)90012-1","article-title":"Optimum domination in weighted trees","volume":"7","author":"Natarajan","year":"1978","journal-title":"Information Processing Lett."},{"key":"10.1016\/0167-6377(82)90015-3_BIB14","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","article-title":"Triangulated graphs and the elimination process","volume":"32","author":"Rose","year":"1970","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0167-6377(82)90015-3_BIB15","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex eliminations on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6377(82)90015-3_BIB16","series-title":"Linear Programming for Operations Research","author":"Simmons","year":"1972"},{"key":"10.1016\/0167-6377(82)90015-3_BIB17","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1145\/321958.321964","article-title":"R-domination in graphs","volume":"23","author":"Slater","year":"1976","journal-title":"J. ACM"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637782900153?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637782900153?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T11:52:26Z","timestamp":1552909946000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637782900153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["0167637782900153"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(82)90015-3","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}