{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T02:19:58Z","timestamp":1775355598656,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,2,1]],"date-time":"1984-02-01T00:00:00Z","timestamp":444441600000},"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":10759,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1984,2]]},"DOI":"10.1016\/0166-218x(84)90061-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"115-130","source":"Crossref","is-referenced-by-count":166,"title":["Domination, independent domination, and duality in strongly chordal graphs"],"prefix":"10.1016","volume":"7","author":[{"given":"Martin","family":"Farber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(84)90061-1_BIB1","doi-asserted-by":"crossref","unstructured":"R.P. Anstee and M. Farber, Characterizations of totally balanced matrices, J. Algorithms, to appear.","DOI":"10.1016\/0196-6774(84)90028-2"},{"key":"10.1016\/0166-218X(84)90061-1_BIB2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01584535","article-title":"Balanced matrices","volume":"2","author":"Berge","year":"1972","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(84)90061-1_BIB3","series-title":"Proc. Eighth Southeastern Conf. Combinatorics, Graph Theory, and Computing","first-page":"321","article-title":"Independent domination in trees","author":"Beyer","year":"1977"},{"key":"10.1016\/0166-218X(84)90061-1_BIB4","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\/0166-218X(84)90061-1_BIB5","unstructured":"G.J. Chang, Private communication, 1982."},{"key":"10.1016\/0166-218X(84)90061-1_BIB6","series-title":"T.R. 540","article-title":"The k-domination and k-stability problems on graphs","author":"Chang","year":"1982"},{"key":"10.1016\/0166-218X(84)90061-1_BIB7","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":"Inform. Process. Letters"},{"key":"10.1016\/0166-218X(84)90061-1_BIB8","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\/0166-218X(84)90061-1_BIB9","series-title":"Proc. Twelfth Southeastern Conf. Combinatorics, Graph Theory, and Computing","article-title":"Domination and duality in weighted trees","author":"Farber","year":"1982"},{"key":"10.1016\/0166-218X(84)90061-1_BIB10_1","series-title":"Ph.D. Thesis","article-title":"Applications of 1.p. duality to problems involving independence and domination","author":"Farber","year":"1982"},{"key":"10.1016\/0166-218X(84)90061-1_BIB10_2","series-title":"Technical Report 81-13","article-title":"Applications of 1.p. duality to problems involving independence and domination","author":"Farber","year":"1981"},{"key":"10.1016\/0166-218X(84)90061-1_BIB11","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0167-6377(82)90015-3","article-title":"Independent domination in chordal graphs","volume":"1","author":"Farber","year":"1982","journal-title":"Operations Research Letters"},{"key":"10.1016\/0166-218X(84)90061-1_BIB12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(84)90061-1_BIB13","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/BFb0121244","article-title":"On balanced matrices","volume":"1","author":"Fulkerson","year":"1974","journal-title":"Math. Programming Study"},{"key":"10.1016\/0166-218X(84)90061-1_BIB14","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(84)90061-1_BIB15","unstructured":"A.J. Hoffman, A.W.J. Kolen and M. Sakarovitch, Totally-balanced and greedy matrices, submitted to SIAM J. Algebraic Discrete Methods."},{"key":"10.1016\/0166-218X(84)90061-1_BIB16","first-page":"191","article-title":"A polynomial algorithm in linear programming","volume":"20","author":"Khachian","year":"1979","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0166-218X(84)90061-1_BIB17","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/0166-218X(84)90061-1_BIB18","series-title":"Masters thesis","article-title":"\u039b-free matrices","author":"Lubiw","year":"1982"},{"key":"10.1016\/0166-218X(84)90061-1_BIB19","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":"Inform. Process. Letters"},{"key":"10.1016\/0166-218X(84)90061-1_BIB20","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\/0166-218X(84)90061-1_BIB21","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(84)90061-1_BIB22","series-title":"Linear Programming for Operations Research","author":"Simmons","year":"1972"},{"key":"10.1016\/0166-218X(84)90061-1_BIB23","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. Assoc. Comput. Mach."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X84900611?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X84900611?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:26:48Z","timestamp":1555122408000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X84900611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,2]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,2]]}},"alternative-id":["0166218X84900611"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(84)90061-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1984,2]]}}}