Domination and total domination on asteroidal triple-free graphs

Discrete Applied Mathematics

Volumn 99, Issue 1-3, 2000, Pages 111-123

  Kratsch, Dieter ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0242264235     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00128-6     Document Type: Article

References (31)

1. Arnborg S., Corneil D.G., Proskurowski A. Complexity of finding embeddings in a. k -tree SIAM J. Algebraic Discrete Meth. 8:1987;277-284.
2. H. Balakrishnan, R. Rajaraman, C. Pandu Rangan, Connected domination and Steiner set on asteroidal triple-free graphs, Proceedings of WADS'93, Lecture Notes in Computer Science, vol. 709, Springer, Berlin, 1993, pp. 131-141.
3. A. Brandstädt, Special graph classes - a survey, Schriftenreihe des Fachbereichs Mathematik, SM-DU-199, Universität Duisburg Gesamthochschule, 1991.
4. A. Brandstädt, V.D. Chepoi, F.F. Dragan, The algorithmic use of hypertree structure and maximum neighbourhood orderings, Proceedings of WG'94, Lecture Notes in Computer Science, vol. 903, Springer, Berlin, 1995, pp. 65-80.
5. H. Breu, D.G. Kirkpatrick, Algorithms for dominating and Steiner set problems in cocomparability graphs, manuscript, 1993.
6. H. Broersma, T. Kloks, D. Kratsch, H. Müller, Independent sets in asteroidal triple-free graphs, Proceedings of ICALP'97, Lecture Notes in Computer Science, vol. 1256, Springer, Berlin, 1997, pp. 760-770.
7. Chang G.J. Labelling algorithms for domination problems in sunfree chordal graphs. Discrete Appl. Math. 22:1988;21-34.
8. Chang M.S. Efficient algorithms for the domination problems on interval and circular-arc graphs. SIAM J. Comput. 27;1998.
9. Corneil D.G., Olariu S., Stewart L. A linear time algorithm to compute a dominating path in an AT-free graph. Inform. Process. Lett. 54:1995;253-258.
10. D.G. Corneil, S. Olariu, L. Stewart, A linear time algorithm to compute dominating pairs in asteroidal triple-free graphs, Proceedings of ICALP'95, Lecture Notes in Computer Science, vol. 944, Springer, Berlin, 1995, pp. 292-302.
11. Corneil D.G., Olariu S., Stewart L. Asteroidal triple-free graphs. SIAM J. Discrete Math. 10:1997;399-430.
12. Corneil D.G., Perl Y. Clustering and domination in perfect graphs. Discrete Appl. Math. 9:1984;27-39.
13. Corneil D.G., Stewart L. Dominating sets in perfect graphs. Discrete Math. 86:1990;145-164.
14. J.S. Deogun, D. Kratsch, Diametral path graphs, Proceedings of WG'95, Lecture Notes in Computer Science, vol. 1017, Springer, Berlin, 1995, pp. 344-357.
15. Duchet P., Meyniel H. On Hadwiger's number and the stability number. Ann. Discrete Math. 13:1982;71-74.
16. Elmallah E.S., Stewart L.K. Independence and domination in polygon graphs. Discrete Appl. Math. 44:1993;65-77.
17. Farber M. Domination, independent domination, and duality in strongly chordal graphs. Discrete Appl. Math. 7:1984;115-130.
18. Farbar M., Keil M. Domination in permutation graphs. J. Algorithms. 6:1985;309-321.
19. O. Favaron, D. Kratsch, Ratios of domination parameter, in: V. Kulli (Ed.), Advances in Graph Theory, Vishwa International, India, 1991, pp. 173-182.
20. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
21. T. Haynes, S.T. Hedetniemi, P. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, USA, 1998.
22. T. Haynes, S.T. Hedetniemi, P. Slater (Eds.), Domination in Graphs: Advanced Topics, Marcel Dekker, New York, USA, 1998.
23. S.T. Hedetniemi, R.C. Laskar (Eds.), Special Volume: Topics on Domination, Discrete Math. 86 (1990).
24. Johnson D.S. The NP-completeness column: an ongoing guide. J. Algorithms. 5:1984;147-160.
25. Keil J.M. The complexity of domination problems in circle graphs. Discrete Appl. Math. 42:1993;51-63.
26. T. Kloks, D. Kratsch, H. Müller, Approximating the bandwidth for AT-free graphs, Proceedings of ESA'95, Lecture Notes in Computer Science, vol. 979, Springer, Berlin, 1995, pp. 434-447.
27. Kratsch D., Stewart L. Domination on cocomparability graphs. SIAM J. Discrete Math. 6:1993;400-417.
28. Kratsch D., Stewart L. Total domination and transformation. Inform. Process. Lett. 63:1997;167-170.
29. Rhee C., Liang Y.D., Dhall S.K., Lakshmivarahan S. An. O(n+m) -time algorithm for finding a minimum-weight dominating set in a permutation graph SIAM J. Comput. 25:1996;404-419.
30. Tsai K., Hsu W.L. Fast algorithms for the dominating set problem on permutation graphs. Algorithmica. 9:1993;109-117.
31. Yannakakis M. Computing the minimum fill-in is NP-complete. SIAM J. Algebraic Discrete Meth. 2:1981;77-79.