{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T10:06:46Z","timestamp":1764238006407},"reference-count":30,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"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":5403,"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":[[1998,10]]},"DOI":"10.1016\/s0166-218x(98)00060-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:35:45Z","timestamp":1027604145000},"page":"245-253","source":"Crossref","is-referenced-by-count":12,"title":["Weighted connected domination and Steiner trees in distance-hereditary graphs"],"prefix":"10.1016","volume":"87","author":[{"given":"Yeh","family":"Hong-Gwa","sequence":"first","affiliation":[]},{"given":"Gerard J.","family":"Chang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00060-2_BIB1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","article-title":"Linear time algorithms for NP-hard problems restricted to partial k-trees","volume":"23","author":"Arnborg","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00060-2_BIB2","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\/S0166-218X(98)00060-2_BIB3","article-title":"A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs","author":"Brandst\u00e4dt","year":"1994","journal-title":"Preprint"},{"key":"10.1016\/S0166-218X(98)00060-2_BIB4","first-page":"253","article-title":"Parity graphs","volume":"21","author":"Burlet","year":"1984","journal-title":"Annals of Discrete Math."},{"key":"10.1016\/S0166-218X(98)00060-2_BIB5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(88)90120-5","article-title":"Labeling algorithms for domination problems on sun-free chordal graphs","volume":"22","author":"Chang","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00060-2_BIB6","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0166-218X(94)00067-3","article-title":"Weighted independent perfect domination on cocomparability graphs","volume":"63","author":"Chang","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00060-2_BIB7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0012-365X(90)90359-P","article-title":"Permutation graphs: connected domination and Steiner trees","volume":"86","author":"Colbourn","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(98)00060-2_BIB8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00060-2_BIB9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","article-title":"Clustering and domination in perfect graphs","volume":"9","author":"Corneil","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00060-2_BIB10","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(98)00060-2_BIB11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0012-365X(90)90357-N","article-title":"Dominating sets in perfect graphs","volume":"86","author":"Corneil","year":"1990","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(98)00060-2_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01582008","article-title":"The traveling salesman problem on a graph and some related integer polyhedra","volume":"33","author":"Cornuejols","year":"1985","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(98)00060-2_BIB13","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(98)00060-2_BIB14","first-page":"249","article-title":"The Steiner tree problem and homogeneous sets","volume":"vol. 324","author":"D'Atri","year":"1988"},{"key":"10.1016\/S0166-218X(98)00060-2_BIB15","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1137\/S0895480192225032","article-title":"Steiner distance-hereditary graphs","volume":"7","author":"Day","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(98)00060-2_BIB16","first-page":"213","article-title":"Distance-hereditary graphs and multidestination message-routing in multicomputers","volume":"13","author":"Esfahanian","year":"1993","journal-title":"JCMCC"},{"key":"10.1016\/S0166-218X(98)00060-2_BIB17","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."},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","key":"10.1016\/S0166-218X(98)00060-2_BIB18"},{"key":"10.1016\/S0166-218X(98)00060-2_BIB19","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\/S0166-218X(98)00060-2_BIB20","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","article-title":"A characterization of distance-hereditary graphs","volume":"28","author":"Howorka","year":"1977","journal-title":"Quart. J. Math. Oxford Ser. 2"},{"year":"1992","series-title":"The Steiner Tree Problem","author":"Hwang","key":"10.1016\/S0166-218X(98)00060-2_BIB21"},{"key":"10.1016\/S0166-218X(98)00060-2_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\/S0166-218X(98)00060-2_BIB23","article-title":"Domination and irredundance in split graphs","volume":"430","author":"Laskar","year":"1983"},{"key":"10.1016\/S0166-218X(98)00060-2_BIB24","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0304-3975(87)90067-3","article-title":"The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs","volume":"53","author":"M\u00fcller","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(98)00060-2_BIB25","article-title":"NP-completeness of total and connected domination and irredundance for bipartite graphs","volume":"428","author":"Pfaff","year":"1983"},{"article-title":"A polynomial algorithm for a class of Steiner tree problems on graphs","year":"1982","author":"Rardin","key":"10.1016\/S0166-218X(98)00060-2_BIB26"},{"key":"10.1016\/S0166-218X(98)00060-2_BIB27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230170102","article-title":"The node-weighted Steiner tree problem","volume":"17","author":"Segev","year":"1987","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00060-2_BIB28","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\/S0166-218X(98)00060-2_BIB29","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","article-title":"Steiner tree, partial 2-trees, and minimum IFI networks","volume":"13","author":"Wald","year":"1983","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00060-2_BIB30","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":"Networks"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000602?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000602?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:52:00Z","timestamp":1556117520000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":30,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0166218X98000602"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00060-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}