Total domination and transformation

Information Processing Letters

Volumn 63, Issue 3, 1997, Pages 167-170

  Kratsch, Dieter ^a   Stewart, Lorna ^b  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Design of algorithms; Domination; Efficient algorithms

Indexed keywords

ALGORITHMS; EQUIVALENCE CLASSES; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

CHORDAL BIPARTITE GRAPHS; GRAPH CLASSES; PERMUTATION GRAPHS; TOTAL DOMINATING SET;

COMPUTATIONAL COMPLEXITY;

EID: 0031208123     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00115-4     Document Type: Article

References (9)

1. K. Arvind, H. Breu, M.S. Chang, D.G. Kirkpatrick, F.-Y. Lee, Y.D. Liang, K. Madhukar, C. Pandu Rangan and A. Srinivasan, Efficient algorithms in cocomparability and trapezoid graphs, Manuscript, 1996.
2. A. Brandstädt, Special graph classes - A survey, Tech. Rept. SM-DU-199, Universität Duisburg, 1991.
3. A. Brandstädt, F.F. Dragan and F. Nicolai, Homogeneously orderable graphs and the Steiner Tree problem, in: Proc. 21st Internat. Workshop "Graph-Theoretic Concepts in Computer Science" (WG'95), Lecture Notes in Computer Science, Vol. 1017 (Springer, Berlin, 1995) 381-395.
4. H. Breu and D.G. Kirkpatrick, Algorithms for dominating and Steiner set problems in cocomparability graphs, Manuscript, 1993.
5. D.G. Corneil and L.K. Stewart, Dominating sets in perfect graphs, Discrete Math. 86 (1990) 145-164.
6. P. Damaschke, H. Müller and D. Kratsch, Domination in convex and chordal bipartite graphs, Inform. Process. Lett. 36 (1990) 231-236.
7. D. Kratsch, Algorithms, Manuscript for Chapter 8 of a Volume on Domination, 1996.
8. C. Rhee, Y.D. Liang, S.K. Dhall and S. Lakshmivarahan, An O(n+m) algorithm for finding a minimum-weight dominating set in a permutation graph, SIAM J. Comput. 25 (1996) 404-419.
9. K. Tsai and W.L. Hsu, Fast algorithms for the dominating set problem on permutation graphs, Algorithmica 9 (1993) 109-117.