The weighted perfect domination problem and its variants

Discrete Applied Mathematics

Volumn 66, Issue 2, 1996, Pages 147-160

  Yen, Chain Chin ^a   Lee, R C T ^b  

^a Ministry of Transportation and Communications Taiwan   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Block; Block graph; Connected perfect domination; Cut vertex; Dynamic programming; Independent perfect domination; Perfect domination; Total perfect domination

Indexed keywords

EID: 0012487270     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(94)00138-4     Document Type: Article

References (18)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
2. D.W. Bange, A.E. Barkauskas and P.T. Slater, Efficient dominating sets in graphs, in: R.D. Ringeisen and F.S. Roberts, eds., Applications of Discrete Mathematics (SIAM, Philad., 1988) 189-199.
3. N. Biggs, Perfect codes in graphs, J. Combin. Theory B 15 (1973) 289-296.
4. G.J. Chang, Labeling algorithm for domination problems in sun-free chordal graphs, Discrete Appl. Math. 22 (1988-1989) 21-34.
5. G.J. Chang and G.L. Nemhauser, The k-domination and k-stability problems on sun-free chordal graphs, SIAM J. Alg. Disc. Methods 5 (1984) 332-345.
6. G.J. Chang, C. Pandu Rangan and S.R. Coorg, Weighted independent perfect domination on cocomparability graphs, DIMACS Report 93-24 (1993).
7. M.S. Chang and Y.C. Liu, Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs, manuscript.
8. M.S. Chang and Y.C. Liu, Polynomial algorithms for the weighted perfect domination problems on interval and circular-arc graphs, manuscript.
9. E.J. Cockayne, S. Goodman and S.T. Hedetniemi, A linear algorithm for the domination number of a tree, Inform. Process. Lett. 4 (1975) 41-44.
10. F. Harary, A characterization of block graphs, Can. Math. Bull. 6 (1963) 1-6.
11. S.F. Hwang and G.J. Chang, A linear time algorithm for the edge domination problem of a block graph, manuscript.
12. R. Laskar, J. Pfaff, S.M. Hedetniemi and S.T. Hedetniemi, On the algorithmic complexity of total domination, SIAM J. Alg. Disc. Methods 5 (1984) 420-425.
13. R. Laskar and H.B. Walikan, On domination related concepts in graph theory, Combinatorics and Graph Theory Proc., Lecture Notes in Mathematics, Vol. 885, (Springer, Berlin, 1980) 308-320.
14. M. Livingston and Q.F. Stout, Perfect dominating sets, Congr. Numer. 79 (1990) 187-203.
15. P.J. Slater, R-domination in graphs, J. ACM 23 (1976) 446-450.
16. P.M. Weichsel, Dominating sets in n cubes, J. Graph Theory, to appear.
17. C.C. Yen and R.C.T. Lee, The weighted perfect domination problem, Inform. Process. Lett. 35 (1990) 295-299.
18. C.C. Yen and R.C.T Lee, A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs, Eur. J. Oper. Res. 73 (1995) 192-198.