Acyclic domination on bipartite permutation graphs

Information Processing Letters

Volumn 99, Issue 4, 2006, Pages 139-144

  Xu, Guangjun ^a   Kang, Liying ^a   Shan, Erfang ^a  

^a SHANGHAI UNIVERSITY   (China)

Author keywords

Acyclic dominating set; Algorithms; Bipartite permutation graph; Dominating set

Indexed keywords

ALGORITHMS; CHAOS THEORY; LINEAR ALGEBRA; PROBABILITY; PROBLEM SOLVING; SET THEORY;

ACYCLIC DOMINATING SET; BIPARTITE PERMUTATION GRAPH; DOMINATING SET; LINEAR TIME ALGORITHM;

GRAPH THEORY;

EID: 33744509931     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.04.002     Document Type: Article

References (9)

1. Bondy J.A., and Murty U.S.R. Graph Theory with Applications (1976), Elsevier/North-Holland, Amsterdam
2. Chao H.S., Hsu F.R., and Lee R.C.T. An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs. Discrete Appl. Math. 102 (2000) 159-173
3. Haynes T.W., Hedetniemi S.T., and Slater P.J. Fundamentals of Domination in Graphs (1998), Marcel Dekker, New York
4. Haynes T.W., Hedetniemi S.T., and Slater P.J. Domination in Graphs: Advanced Topics (1998), Marcel Dekker, New York
5. Hedetniemi S.M., Hedetniemi S.T., and Rall D.F. Acyclic domination. Discrete Math. 222 (2000) 151-165
6. Lu C.L., and Tang C.Y. Solving the weighted efficient edge domination problem on bipartite permutation graphs. Discrete Appl. Math. 87 (1998) 203-211
7. Lu C.L., and Tang C.Y. Weighted efficient domination problem on some perfect graphs. Discrete Appl. Math. 117 (2002) 163-182
8. Spinrad J., Brandstädt A., and Stewart L. Bipartite permutation graphs. Discrete Appl. Math. 18 (1987) 279-292
9. Srinivasan A., Madhukar K., Nagavamsi P., Rangan C.P., and Chang M.S. Edge domination on bipartite permutation graphs and cotriangulated graphs. Inform. Process. Lett. 56 (1995) 165-171