{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T13:29:27Z","timestamp":1745933367993},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":4215,"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":[[2002,1]]},"DOI":"10.1016\/s0166-218x(00)00330-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:01:11Z","timestamp":1027587671000},"page":"103-113","source":"Crossref","is-referenced-by-count":28,"title":["Domination in distance-hereditary graphs"],"prefix":"10.1016","volume":"116","author":[{"given":"Maw-Shang","family":"Chang","sequence":"first","affiliation":[]},{"given":"Shaur-Ching","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Gerard J.","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Hong-Gwa","family":"Yeh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00330-9_BIB1","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","article-title":"Distance-hereditary graphs","volume":"41","author":"Bandelt","year":"1986","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/S0166-218X(00)00330-9_BIB2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/(SICI)1097-0037(199805)31:3<177::AID-NET4>3.0.CO;2-C","article-title":"A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs","volume":"31","author":"Brandst\u00e4dt","year":"1998","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(00)00330-9_BIB3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(88)90120-5","article-title":"Labeling algorithms for domination problems in sun-free chordal graphs","volume":"22","author":"Chang","year":"1988","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/S0166-218X(00)00330-9_BIB4","doi-asserted-by":"crossref","unstructured":"G.J. Chang, Algorithmic aspects of domination in graphs, in: D.-Z. Du, P.M. Pardalos (Eds.), Handbook of Combinatorial optimization 3 (1998) 339\u2013405.","DOI":"10.1007\/978-1-4613-0303-9_28"},{"key":"10.1016\/S0166-218X(00)00330-9_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":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(00)00330-9_BIB6","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1137\/0217032","article-title":"Distance-hereditary graphs, Steiner trees, and connected domination","volume":"17","author":"D'Atri","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00330-9_BIB7","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/3-540-58218-5_34","article-title":"Dominating cliques in distance-hereditary graphs","volume":"824","author":"Dragan","year":"1994","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S0166-218X(00)00330-9_BIB8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","article-title":"Completely separable graa minimum L-dominating set ofphs","volume":"27","author":"Hammer","year":"1990","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/S0166-218X(00)00330-9_BIB9","series-title":"Fundamental of Domination in Graphs","author":"Haynes","year":"1998"},{"key":"10.1016\/S0166-218X(00)00330-9_BIB10","series-title":"Domination in Graphs\u2014Advanced Topics","author":"Haynes","year":"1998"},{"key":"10.1016\/S0166-218X(00)00330-9_BIB11","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0012-365X(90)90365-O","article-title":"Bibliography on domination in graphs and some basic definitions of domination parameters","volume":"86","author":"Hedetniemi","year":"1990","journal-title":"Disc. Math."},{"key":"10.1016\/S0166-218X(00)00330-9_BIB12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.7151\/dmgt.1006","article-title":"The edge domination problem","volume":"15","author":"Hwang","year":"1995","journal-title":"Discussiones Math.-Graph Theory"},{"key":"10.1016\/S0166-218X(00)00330-9_BIB13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0020-0190(97)00115-4","article-title":"Total domination and transformation","volume":"63","author":"Kratsch","year":"1997","journal-title":"Inform. Proc. Letters"},{"key":"10.1016\/S0166-218X(00)00330-9_BIB14","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1137\/0605040","article-title":"On the algorithm complexity of total domination","volume":"5","author":"Laskar","year":"1984","journal-title":"SIAM J. Alg. Disc. Methods"},{"key":"10.1016\/S0166-218X(00)00330-9_BIB15","unstructured":"S.L. Mitchell, S.T. Hedetniemi, Edge domination in trees, in: Proceedings of the Eighth S. E. Conference on Combinatorics, Graph Theory and Computing, Utilitas Math., Winnipeg, 1977, pp. 489\u2013509."},{"key":"10.1016\/S0166-218X(00)00330-9_BIB16","unstructured":"F. Nicolai, T. Szymczak, Homogeneous sets and domination: a linear time algorithm for distance-hereditary graphs, University of Duisburg, Technical Report SM-DU-336, 1996."},{"key":"10.1016\/S0166-218X(00)00330-9_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. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(00)00330-9_BIB18","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/0138030","article-title":"Edge dominating sets in graphs","volume":"38","author":"Yannakakis","year":"1980","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(00)00330-9_BIB19","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0166-218X(98)00060-2","article-title":"Weighted connected domination and Steiner trees in distance-hereditary graphs","volume":"87","author":"Yeh","year":"1998","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/S0166-218X(00)00330-9_BIB20","doi-asserted-by":"crossref","unstructured":"H.G. Yeh, G.J. Chang, Weighted k-domination and weighted k-dominating clique in distance-hereditary graphs, Theoret. Comput. Sci., accepted.","DOI":"10.1016\/S0304-3975(00)00225-5"},{"key":"10.1016\/S0166-218X(00)00330-9_BIB21","unstructured":"A.H. Esfahanian, O.R. Oellermann, Distance-hereditary graphs and multidestination message-routing in multicomputers, JCMCC 13 (1993) 213\u2013222; for further reading."},{"key":"10.1016\/S0166-218X(00)00330-9_BIB22","doi-asserted-by":"crossref","unstructured":"E. Howorka, A characterization of distance-hereditary graphs, Quart. J. Math. Oxford 28 (2) (1977) 417\u2013420; for further reading.","DOI":"10.1093\/qmath\/28.4.417"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003309?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003309?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T20:27:04Z","timestamp":1556569624000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0166218X00003309"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00330-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}