{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:53:46Z","timestamp":1742385226721},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"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":4399,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00225-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:59:17Z","timestamp":1027580357000},"page":"3-8","source":"Crossref","is-referenced-by-count":10,"title":["Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs"],"prefix":"10.1016","volume":"263","author":[{"given":"Hong-Gwa","family":"Yeh","sequence":"first","affiliation":[]},{"given":"Gerard J.","family":"Chang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00225-5_BIB1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0166-218X(97)00125-X","article-title":"The algorithmic use of hypertree structure and maximum neighborhood orderings","volume":"82","author":"Brandst\u00e4dt","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(00)00225-5_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\/S0304-3975(00)00225-5_BIB3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(87)90128-9","article-title":"On domination problems for permutation and other graphs","volume":"54","author":"Brandst\u00e4dt","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00225-5_BIB4","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, Series B."},{"key":"10.1016\/S0304-3975(00)00225-5_BIB5","doi-asserted-by":"crossref","unstructured":"G.J. Chang, Labeling algorithms for domination problems in sun-free chordal graphs, Discrete Appl. Math. 22 (1988\/1989) 21\u201334.","DOI":"10.1016\/0166-218X(88)90120-5"},{"key":"10.1016\/S0304-3975(00)00225-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. Algebra. Discrete Meth."},{"key":"10.1016\/S0304-3975(00)00225-5_BIB7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0012-365X(90)90353-J","article-title":"Dominating cliques in graphs","volume":"86","author":"Cozzens","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(00)00225-5_BIB8","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."},{"issue":"2","key":"10.1016\/S0304-3975(00)00225-5_BIB9","first-page":"64","article-title":"HT-graphs: centers, connected r-domination and Steiner trees","volume":"1","author":"Dragan","year":"1993","journal-title":"Comput. Sci. J. Moldova"},{"key":"10.1016\/S0304-3975(00)00225-5_BIB10","first-page":"370","volume":"Vol. 824","author":"Dragan","year":"1994"},{"key":"10.1016\/S0304-3975(00)00225-5_BIB11","first-page":"735","volume":"Vol. 775","author":"Dragan","year":"1994"},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","key":"10.1016\/S0304-3975(00)00225-5_BIB12"},{"key":"10.1016\/S0304-3975(00)00225-5_BIB13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","article-title":"Completely separable graphs","volume":"27","author":"Hammer","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(00)00225-5_BIB14","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","article-title":"A characterization of distance-hereditary graphs","volume":"2, 28","author":"Howorka","year":"1977","journal-title":"Quart. J. Math. Oxford Ser."},{"key":"10.1016\/S0304-3975(00)00225-5_BIB15","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\/S0304-3975(00)00225-5_BIB16","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0012-365X(90)90363-M","article-title":"Finding dominating cliques efficiently in strongly chordal graphs and undirected path graphs","volume":"86","author":"Kratsch","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(00)00225-5_BIB17","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0012-365X(94)90118-X","article-title":"Dominating cliques in chordal graphs","volume":"128","author":"Kratsch","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(00)00225-5_BIB18","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/0406032","article-title":"Domination of cocomparability graphs","volume":"6","author":"Kratsch","year":"1993","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(00)00225-5_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(91)90265-4","article-title":"Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs","volume":"91","author":"Srinivasan","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00225-5_BIB20","doi-asserted-by":"crossref","first-page":"343","DOI":"10.11650\/twjm\/1500405694","article-title":"Algorithmic aspects of majority domination","volume":"1","author":"Yeh","year":"1997","journal-title":"Taiwanese J. Math."},{"key":"10.1016\/S0304-3975(00)00225-5_BIB21","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":"Discrete Appl. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002255?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002255?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T06:21:41Z","timestamp":1556778101000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500002255"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00225-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}