Solving the weighted efficient edge domination problem on bipartite permutation graphs

Discrete Applied Mathematics

Volumn 87, Issue 1-3, 1998, Pages 203-211

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

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Algorithms; Bipartite graphs; Bipartite permutation graphs; Efficient edge domination; NP complete

Indexed keywords

EID: 0043223521     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-218x(98)00057-2     Document Type: Article

References (16)

1. D. Bange, A. Barkauskas, P.J. Slater, Efficient dominating sets in graphs, in: R.D. Ringeisen, F.S. Roberts (Eds.), Application of Discrete Mathematics, SIAM, Philadelphia, PA, 1988, pp. 189-199.
2. A. Brandstädt, J. Spinrad, L. Stewart, Bipartite permutation graphs are bipartite tolerance graphs, Congr. Numer. 58 (1987) 165-174.
3. M.S. Chang, Y.C. Liu, Polynomial algorithm for the weighted perfect domination problems on chordal graphs and split graphs, Inform. Process. Lett. 48 (1993) 205-210.
4. G.J. Chang, C. Pandu Rangan, S.R. Coorg, Weighted independent perfect domination on cocomparability graphs, Discrete Appl. Math. 63 (1995) 215-222.
5. M.R. Garey, D.S. Johnson, Computer and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
6. D.L. Grinstead, P.J. Slater, N.A. Sherwani, N.D. Holmes, Efficient edge domination problems in graphs, Inform. Process. Lett. 8 (1993) 221-228.
7. M.C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.
8. Y.D. Liang, C.L. Lu, C.Y. Tang, Efficient domination on permutation graphs and trapezoid graphs, in: T. Jiang, D.T. Lee (Eds.), COCOON'97, Lecture Notes in Computer Science, vol. 1276, Springer, Berlin, 1997, pp. 232-241.
9. M. Livingston, Q. Stout, Distributing resource in hypercube computers, in: Proceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications, 1988, pp. 222-231.
10. C.L. Lu, C.Y. Tang, Efficient domination on bipartite graphs, manuscript.
11. M. Pal, G.P. Bhattacharjee, The parallel algorithms for determining edge-packing and efficient edge dominating sets in interval graphs, Parallel Algorithms Appl. 7 (1995) 193-207.
12. J. Spinrad, A. Brandstädt, L. Stewart, Bipartite permutation graphs, Discrete Appl. Math. 18 (1987) 279-292.
13. C.C. Yen, Algorithmic Aspects of Perfect Domination, Ph.D. Thesis, Department of Computer Science, National Tsing Hua University, Taiwan, R.O.C., 1992.
14. C.C. Yen, R.C.T. Lee, The weighted perfect domination problem, Inform. Process. Lett. 35 (1990) 295-299.
15. C.C. Yen, R.C.T. Lee, A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs, Eur. J. Oper. Res. 73 (1994) 192-198.
16. C.C. Yen, R.C.T. Lee, The weighted perfect domination problem and its variants, Discrete Appl. Math. 66 (1996) 147-160.