{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T10:05:22Z","timestamp":1761127522072},"reference-count":36,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":4156,"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,3]]},"DOI":"10.1016\/s0166-218x(01)00184-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:52:51Z","timestamp":1027583571000},"page":"163-182","source":"Crossref","is-referenced-by-count":36,"title":["Weighted efficient domination problem on some perfect graphs"],"prefix":"10.1016","volume":"117","author":[{"given":"Chin Lung","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan Yi","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00184-6_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(01)00184-6_BIB2","series-title":"Disjoint dominating sets in trees, Technical Report SAND78-1087J","author":"Bange","year":"1978"},{"key":"10.1016\/S0166-218X(01)00184-6_BIB3","series-title":"Application of Discrete Mathematics","first-page":"189","article-title":"Efficient dominating sets in graphs","author":"Bange","year":"1988"},{"key":"10.1016\/S0166-218X(01)00184-6_BIB4","series-title":"Proceedings of the Fourth British Combinatorial Conference London Mathematical Society Lecture Notes, Vol. 13","first-page":"1","article-title":"Perfect codes and distance transitive graphs","author":"Biggs","year":"1973"},{"key":"10.1016\/S0166-218X(01)00184-6_BIB5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0095-8956(73)90042-7","article-title":"Perfect codes in graphs","volume":"15","author":"Biggs","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(01)00184-6_BIB6","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(01)00184-6_BIB7","series-title":"Graph Classes\u2014A Survey, SIAM Monographs on Discrete Mathematics and Applications","author":"Brandst\u00e4dt","year":"1999"},{"key":"10.1016\/S0166-218X(01)00184-6_BIB8","first-page":"165","article-title":"Bipartite permutation graphs are bipartite tolerance graphs","volume":"58","author":"Brandst\u00e4dt","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(01)00184-6_BIB9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0166-218X(97)80001-7","article-title":"Weighted domination of cocomparability graphs","volume":"80","author":"Chang","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00184-6_BIB10","series-title":"Proceedings of the Eighth Annual International Symposium on Algorithms and Computation (ISAAC\u201997), Lecture Notes in Computer Science, Vol. 1350","first-page":"344","article-title":"Dynamic programming on distance-hereditary graphs","author":"Chang","year":"1997"},{"key":"10.1016\/S0166-218X(01)00184-6_BIB11","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0020-0190(93)90147-2","article-title":"Polynomial algorithm for the weighted perfect domination problems on chordal graphs and split graphs","volume":"48","author":"Chang","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(01)00184-6_BIB12","first-page":"549","article-title":"Polynomial algorithms for weighted perfect domination problems on interval and circular-arc graphs","volume":"10","author":"Chang","year":"1994","journal-title":"J. Inform. Sci. Eng."},{"key":"10.1016\/S0166-218X(01)00184-6_BIB13","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(01)00184-6_BIB14","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\u00e1tri","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(01)00184-6_BIB15","series-title":"Proceedings of the Fourth Scandinavian Workshop on Algorithm Theory (SWAT\u201994), Lecture Notes in Computer Science, Vol. 824","first-page":"370","article-title":"Dominating cliques in distance-hereditary graphs","author":"Dragan","year":"1994"},{"key":"10.1016\/S0166-218X(01)00184-6_BIB16","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/0196-6774(86)90002-7","article-title":"Planar 3DM is NP-complete","volume":"7","author":"Dyer","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(01)00184-6_BIB17","first-page":"141","article-title":"Perfect domination","volume":"3","author":"Fellows","year":"1991","journal-title":"Austral. J. Combin."},{"key":"10.1016\/S0166-218X(01)00184-6_BIB18","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability\u2014A Guide to the Theory of NP-Completeness, San Francisco, Freeman, 1979."},{"key":"10.1016\/S0166-218X(01)00184-6_BIB19","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(01)00184-6_BIB20","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(01)00184-6_BIB21","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0095-8956(75)90087-8","article-title":"Perfect codes in the graphs Qk","volume":"19","author":"Hammond","year":"1975","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(01)00184-6_BIB22","series-title":"Fundamentals of Domination in Graphs","author":"Haynes","year":"1998"},{"key":"10.1016\/S0166-218X(01)00184-6_BIB23","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":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00184-6_BIB24","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"},{"key":"10.1016\/S0166-218X(01)00184-6_BIB25","series-title":"Proceedings of the Third Annual International Computing and Combinatorics Conference (COCOON\u201997), Lecture Notes in Computer Science, Vol. 1276","first-page":"232","article-title":"Efficient domination on permutation graphs and trapezoid graphs","author":"Liang","year":"1997"},{"key":"10.1016\/S0166-218X(01)00184-6_BIB26","doi-asserted-by":"crossref","unstructured":"M. Livingston, Q.F. Stout, Distributing resources in hypercube computers, Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications, 1988, pp. 222\u2013231.","DOI":"10.1145\/62297.62324"},{"key":"10.1016\/S0166-218X(01)00184-6_BIB27","first-page":"187","article-title":"Perfect dominating sets","volume":"79","author":"Livingston","year":"1990","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(01)00184-6_BIB28","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","article-title":"Bipartite permutation graphs","volume":"18","author":"Spinrad","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00184-6_BIB29","first-page":"151","article-title":"Recognition of bipartite permutation graphs","volume":"112","author":"Sprague","year":"1995","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(01)00184-6_BIB30","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0012-365X(92)90300-5","article-title":"Distance regular subgraphs of a cube","volume":"109","author":"Weichsel","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00184-6_BIB31","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1002\/jgt.3190180506","article-title":"Dominating sets in n-cubes","volume":"18","author":"Weichsel","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(01)00184-6_BIB32","first-page":"51","article-title":"Perfect dominating sets on cube-connected cycles","volume":"97","author":"Van Wieren","year":"1993","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(01)00184-6_BIB33","series-title":"Algorithmic aspects of perfect domination, Ph.D. Thesis","author":"Yen","year":"1992"},{"key":"10.1016\/S0166-218X(01)00184-6_BIB34","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0020-0190(90)90031-R","article-title":"The weighted perfect domination problem","volume":"35","author":"Yen","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(01)00184-6_BIB35","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/0377-2217(94)90163-5","article-title":"A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs","volume":"73","author":"Yen","year":"1994","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00184-6_BIB36","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0166-218X(94)00138-4","article-title":"The weighted perfect domination problem and its variants","volume":"66","author":"Yen","year":"1996","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01001846?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01001846?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T23:50:58Z","timestamp":1557100258000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01001846"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":36,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0166218X01001846"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00184-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}