Weighted efficient domination problem on some perfect graphs

Discrete Applied Mathematics

Volumn 117, Issue 1-3, 2002, Pages 163-182

  Lu, Chin Lung ^a   Tang, Chuan Yi ^b  

^a NATIONAL CENTER FOR HIGH PERFORMANCE COMPUTING   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Algorithms; Bipartite permutation graphs; Chordal bipartite graphs; Distance hereditary graphs; Efficient domination; Planar bipartite graphs

Indexed keywords

EID: 84867937398     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00184-6     Document Type: Article

References (36)

1. H.J. Bandelt, and H.M. Mulder Distance-hereditary graphs J. Combin. Theory Ser. B 41 1986 182 208
2. D.W. Bange, A. Barkauskas, and P.J. Slater Disjoint dominating sets in trees, Technical Report SAND78-1087J 1978 Sandia Laboratories
3. D.W. Bange, A. Barkauskas, and P.J. Slater Efficient dominating sets in graphs R.D. Ringeisen, F.S. Roberts, Application of Discrete Mathematics 1988 SIAM Philadelphia, PA 189 199
4. N. Biggs Perfect codes and distance transitive graphs F.P. McDonough, V.C. Mavron, Proceedings of the Fourth British Combinatorial Conference London Mathematical Society Lecture Notes, Vol. 13 1973 London Mathematical Society London 1 8
5. N. Biggs Perfect codes in graphs J. Combin. Theory Ser. B 15 1973 289 296
6. A. Brandstädt, and F.F. Dragan A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs Networks 31 1998 177 182
7. A. Brandstädt, V.B. Le, and J.P. Spinrad Graph Classes - A Survey, SIAM Monographs on Discrete Mathematics and Applications 1999 SIAM Philadelphia
8. A. Brandstädt, J. Spinrad, and L. Stewart Bipartite permutation graphs are bipartite tolerance graphs Congr. Numer. 58 1987 165 174
9. M.S. Chang Weighted domination of cocomparability graphs Discrete Appl. Math. 80 1997 135 148
10. M.S. Chang, S.Y. Hsieh, and G.H. Chen Dynamic programming on distance-hereditary graphs H.W. Leong, H. Imai, S. Jain, Proceedings of the Eighth Annual International Symposium on Algorithms and Computation (ISAAC'97), Lecture Notes in Computer Science, Vol. 1350 1997 Springer Berlin 344 353
11. M.S. Chang, and Y.C. Liu Polynomial algorithm for the weighted perfect domination problems on chordal graphs and split graphs Inform. Process. Lett. 48 1993 205 210
12. M.S. Chang, and Y.C. Liu Polynomial algorithms for weighted perfect domination problems on interval and circular-arc graphs J. Inform. Sci. Eng. 10 1994 549 568
13. G.J. Chang, C. Pandu Rangan, and S.R. Coorg Weighted independent perfect domination on cocomparability graphs Discrete Appl. Math. 63 1995 215 222
14. A. Dátri, and M. Moscarini Distance-hereditary graphs, Steiner trees, and connected domination SIAM J. Comput. 17 1988 521 538
15. F.F. Dragan Dominating cliques in distance-hereditary graphs E.M. Schmidt, S. Skyum, Proceedings of the Fourth Scandinavian Workshop on Algorithm Theory (SWAT'94), Lecture Notes in Computer Science, Vol. 824 1994 Springer Berlin 370 381
16. M.E. Dyer, and A.M. Frieze Planar 3DM is NP-complete J. Algorithms 7 1986 174 184
17. M.R. Fellows, and M.N. Hoover Perfect domination Austral. J. Combin. 3 1991 141 150
18. M.R. Garey, D.S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completeness, San Francisco, Freeman, 1979.
19. M.C. Golumbic Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press New York
20. P.L. Hammer, and F. Maffray Completely separable graphs Discrete Appl. Math. 27 1990 85 99
21. k J. Combin. Theory Ser. B 19 1975 239 255
22. T.W. Haynes, S.T. Hedetniemi, and P.J. Slater Fundamentals of Domination in Graphs 1998 Marcel Dekker New York
23. S.T. Hedetniemi, and R. Laskar Bibliography on domination in graphs and some basic definitions of domination parameters Discrete Math. 86 1990 257 277
24. E. Howorka A characterization of distance-hereditary graphs Quart. J. Math., Oxford Ser. 2 28 1977 417 420
25. Y.D. Liang, C.L. Lu, and C.Y. Tang Efficient domination on permutation graphs and trapezoid graphs T. Jiang, D.T. Lee, Proceedings of the Third Annual International Computing and Combinatorics Conference (COCOON'97), Lecture Notes in Computer Science, Vol. 1276 1997 Springer Berlin 232 241 (Pubitemid 127110289)
26. M. Livingston, Q.F. Stout, Distributing resources in hypercube computers, Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications, 1988, pp. 222-231.
27. M. Livingston, and Q.F. Stout Perfect dominating sets Congr. Numer. 79 1990 187 203
28. J. Spinrad, A. Brandstädt, and L. Stewart Bipartite permutation graphs Discrete Appl. Math. 18 1987 279 292
29. A.P. Sprague Recognition of bipartite permutation graphs Congr. Numer. 112 1995 151 161 (Pubitemid 126047898)
30. P.M. Weichsel Distance regular subgraphs of a cube Discrete Math. 109 1992 297 306
31. P.M. Weichsel Dominating sets in n-cubes J. Graph Theory 18 1994 479 488
32. D. Van Wieren, M. Livingston, and Q.F. Stout Perfect dominating sets on cube-connected cycles Congr. Numer. 97 1993 51 70
33. C.C. Yen Algorithmic aspects of perfect domination, Ph.D. Thesis 1992 Department of Computer Science, National Tsing Hua University Taiwan
34. C.C. Yen, and R.C.T. Lee The weighted perfect domination problem Inform. Process. Lett. 35 1990 295 299
35. C.C. Yen, and R.C.T. Lee A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs European J. Oper. Res. 73 1994 192 198
36. C.C. Yen, and R.C.T. Lee The weighted perfect domination problem and its variants Discrete Appl. Math. 66 1996 147 160 (Pubitemid 126374618)