{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T01:44:40Z","timestamp":1776908680831,"version":"3.51.2"},"reference-count":33,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"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":8994,"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":[[1988,12]]},"DOI":"10.1016\/0166-218x(88)90120-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"21-34","source":"Crossref","is-referenced-by-count":58,"title":["Labeling algorithms for domination problems in sun-free chordal graphs"],"prefix":"10.1016","volume":"22","author":[{"given":"Gerard J.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(88)90120-5_BIB1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0196-6774(84)90028-2","article-title":"Characterizations of totally balanced matrices","volume":"5","author":"Anstee","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(88)90120-5_BIB2","series-title":"Report CS-80-34","article-title":"Dominating sets in chordal graphs","author":"Booth","year":"1980"},{"key":"10.1016\/0166-218X(88)90120-5_BIB3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0211015","article-title":"Dominating set in chordal graphs","volume":"11","author":"Booth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(88)90120-5_BIB4","series-title":"Tech. Rept. No. 86438-OR","article-title":"Total domination in block graphs","author":"Chang","year":"1986"},{"key":"10.1016\/0166-218X(88)90120-5_BIB5","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/0167-6377(82)90024-4","article-title":"R-domination on block graphs","volume":"1","author":"Chang","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(88)90120-5_BIB6","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/0605034","article-title":"The k-domination and k-stability problems on sun-free chordal graphs","volume":"5","author":"Chang","year":"1984","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(88)90120-5_BIB7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/0606012","article-title":"Covering, packing and generalized perfection","volume":"6","author":"Chang","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(88)90120-5_BIB8","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. Proc. Lett."},{"key":"10.1016\/0166-218X(88)90120-5_BIB9","series-title":"Research Rept. CS-85-02","article-title":"Permutation graphs: Connected domination and Steiner trees","author":"Colbourn","year":"1985"},{"key":"10.1016\/0166-218X(88)90120-5_BIB10","unstructured":"D.G. Corneil and J.M. Keil, A dynamic programming approach to the dominating set problem on k-trees (to appear)."},{"key":"10.1016\/0166-218X(88)90120-5_BIB11","unstructured":"D.G. Corneil and L.K. Stewart, Dominating sets in perfect graphs (submitted)."},{"key":"10.1016\/0166-218X(88)90120-5_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(88)90120-5_BIB13","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\/0166-218X(88)90120-5_BIB14","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\/0166-218X(88)90120-5_BIB15","series-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(88)90120-5_BIB16","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph","volume":"1","author":"Gavril","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(88)90120-5_BIB17","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(88)90120-5_BIB18","first-page":"113","article-title":"\u00dcber die Aufl\u00f6sung von Graphen in vollst\u00e4ndige Teilgraphen","volume":"1","author":"Hajnal","year":"1958","journal-title":"Ann. Univ. Sci. Budapest E\u00f6tv\u00f6s. Sect. Math."},{"key":"10.1016\/0166-218X(88)90120-5_BIB19","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0166-218X(86)90089-2","article-title":"A linear algorithm for finding a minimum dominating set in a cactus","volume":"13","author":"Hedetniemi","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(88)90120-5_BIB20","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0606070","article-title":"Totally-balanced and greedy matrices","volume":"6","author":"Hoffman","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(88)90120-5_BIB21","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0196-6774(84)90045-2","article-title":"The NP-completeness column: An ongoing guide","volume":"5","author":"Johnson","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(88)90120-5_BIB22","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: An ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(88)90120-5_BIB23","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(86)90022-0","article-title":"Total domination in interval graphs","volume":"22","author":"Keil","year":"1986","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/0166-218X(88)90120-5_BIB24","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\/0166-218X(88)90120-5_BIB25","series-title":"Tech. Rept. 430","article-title":"Domination and irredundance in split graphs","author":"Laskar","year":"1983"},{"key":"10.1016\/0166-218X(88)90120-5_BIB26","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\/0166-218X(88)90120-5_BIB27","series-title":"M.S. Thesis","article-title":"\u0393-free matrices","author":"Lubiw","year":"1982"},{"key":"10.1016\/0166-218X(88)90120-5_BIB28","series-title":"Tech. Rept. 428","article-title":"NP-completeness of total and connected domination and irredundance for bipartite graphs","author":"Pfaff","year":"1983"},{"key":"10.1016\/0166-218X(88)90120-5_BIB29","series-title":"Tech. Rept. 441","article-title":"Linear algorithms for independent domination and total domination in series-parallel graphs","author":"Pfaff","year":"1984"},{"key":"10.1016\/0166-218X(88)90120-5_BIB30","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(88)90120-5_BIB31","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. Comp. Mach."},{"key":"10.1016\/0166-218X(88)90120-5_BIB32","series-title":"Maximum cardinality search and chordal graphs","author":"Tarjan","year":"1976"},{"key":"10.1016\/0166-218X(88)90120-5_BIB33","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230150109","article-title":"Steiner trees, connected domination and strongly chordal graphs","volume":"15","author":"White","year":"1985","journal-title":"Network"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88901205?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88901205?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:54:58Z","timestamp":1555120498000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X88901205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["0166218X88901205"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(88)90120-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}