Algorithms

Domination in Graphs: Advanced Topics

Volumn , Issue , 2017, Pages 191-231

  Kratsch, Dieter ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85063496610     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781315141428     Document Type: Chapter

References (155)

1. G. S. Adhar and S. Peng, Parallel algorithms for cographs and parity graphs with applications. J. Algorithms 11 (1990) 252-284.
2. G. S. Adhar and S. Peng, Parallel algorithms for finding connected, independent and total domination in interval graphs. Manuscript (1992).
3. G. S. Adhar and S. Peng, Mixed domination in trees: a parallel algorithm. Congr. Numer. 100 (1994) 73-80.
4. S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability -a survey. BIT 25 (1985) 2-23.
5. S. Arnborg, J. Lagergren and D. Seese, Easy problems for tree-decomposable graphs. J. Algorithms 12 (1991) 308-340.
6. S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial &-lrees. Discrete Appl. Math. 23 (1989) 11-24.
7. 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).
8. K. Arvind and C. Pandu Rangan, Connected domination and Steiner set on weighted permutation graphs. Inform. Process. Lett. 41 (1992) 215-220.
9. K. Arvind and C. Pandu Rangan, Transitive reduction and efficient poly-log algorithms on permutation graphs. Manuscript.
10. T. Asano, Dynamic programming on intervals. Internal. J. Comput. Geom. Appl. 3 (1993) 323-330.
11. M. J. Atallah and S. R. Kosaraju, An efficient algorithm for maxdomi-nance, with applications. Algorilhmica 4 (1989) 221-236.
12. M. J. Atallah, G. K. Manacher and J. Urrutia, Finding a minimum independent dominating set in a permutation graph. Discrete Appl. Math. 21 (1988) 177-183.
13. s -free graphs. Period. Math. Hungar. 21 (1990) 303-308.
14. H. BaJakrishnan, A. Rajaraman and C. Pandu Rangan, Connected domination and Steiner set on asteroidal triple-free graphs. In Proc. Workshop on Algorithms and Data Structures (WADS’93), Eds. F. Dehne, J. R. Sack, N. Santoro, and S. Whitesides, Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 709 (1993) 131-141.
15. R. Bar-Yehuda and S. Moran, On approximation problems related to the independent set and vertex cover problems. Discrete Appi. Math. 9 (1984) 1-10.
16. M. W. Bern, E. L. Lawler and A. L. Wong, Linear-time computation of optimal subgraphs of decomposable graphs. J. Algorithms 8 (1987) 216-235.
17. P. J. Bernhard, S. T. Hedetniemi and D. P. Jacobs, Efficient sets in graphs. Discrete Appi. Math. 44 (1993) 99-108.
18. A. A. Bertossi, Dominating sets for split and bipartite graphs. Inform. Process. Lett. 19 (1984) 37-40.
19. A. A. Bertossi and M. A. Bonuccelli, Some parallel algorithms on interval graphs. Discrete Appi. Math. 16 (1987) 101-111.
20. A. A. Bertossi and A. Gori, Total domination and irredundance in weighted interval graphs. SIAM J. Discrete Math. 1 (1988) 317-327.
21. A. A. Bertossi and S. Moretti, Parallel algorithms on circular-arc graphs. Inform. Process. Lett. 33 (1990) 275-281.
22. H. L. Bodlaender, Dynamic programming on graphs with bounded treewidth. In International Colloquium on Automata, Languages and Programming (ICALP’88), Eds. T. Lepisto and A. Salomaa, Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 317 (1988) 105-118.
23. H. L. Bodlaender, A tourist guide through treewidth. Acta Cybernet. 11 (1993) 1-23.
24. M. A. Bonuccelli, Dominating sets and domatic number of circular arc graphs. Discrete Appi Math. 12 (1985) 203-213.
25. K. S. Booth and J. H. Johnson, Dominating sets in chordal graphs. SIAM J. Comput. 11 (1982) 191-199.
26. K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Compul. Systems Sei. 13 (1976) 335-379.
27. A. Brandstädt, The computational complexity of feedback vertex set, Hamiltonian circuit, dominating set, Steiner tree, and bandwidth on special perfect graphs. J. Inform. Process. Cybernet. 23 (1987) 471-477.
28. A. Brandstädt, On the domination problem for bipartite graphs. Topics in Combinatorics and Graph Theory, Eds. R. Bodendieck and R. Henn, Physica, Heidelburg (1990) 145-152.
29. A. Brandstädt, Special graph classes -a survey. Technical Report SM-DU-199, Universität Duisburg (1991).
30. A. Brandstädt, On improved bounds for permutation graph problems. In Proceedings of WG’92, Ed. E. W. Mayr, Springer-Verlag, Berlin, Lecture Notes in Compul. Sei. 657 (1993) 1-10.
31. A. Brandstädt and H. Behrendt, Domination and the use of maximum neighbourhoods. Technical Report SM-DU-204, Universität Duisburg (1992).
32. A. Brandstädt, V. D. Chepoi and F. F. Dragan, The algorithmic use of hypertree structure and maximum neighbourhood orderings. Technical Report SM-DU-244, Universität Duisburg (1993).
33. A. Brandstädt, V. D. Chepoi and F. F. Dragan, Clique r-domination and clique r-packing problems on dually chordal graphs. Technical Report SM-DU-251, Universität Duisburg (1994).
34. A. Brandstädt, V. D. Chepoi and F. F. Dragan, The algorithmic use of hypertree structure and maximum neighbourhood orderings. In 20th International Workshop “Graph-Theoretic Concepts in Computer Science” (WG’94), Springer-Verlag, Berlin, Lecture Notes in Compul. Sei. 903 (1995) 65-80.
35. A. Brandstädt and F. F. Dragan, A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs. Technical Report SM-DU-261, University of Duisburg (1994).
36. A. Brandstädt, F. F. Dragan, V. D. Chepoi and V. I. Voloshin, Dually chordal graphs. In 19th International Workshop “Graph-Theoretic Concepts in Computer Science”(WG’93), Springer-Verlag, Berlin, Lecture Notes in Compul. Sci. 790 (1993) 237-251.
37. A. Brandstadt, F. F. Dragan and F. Nicolai, Homogeneously orderable graphs and the Steiner Tree problem. In 21st International Workshop “Graph-Theoretic Concepts in Computer Science”(WG’95), Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 1017 (1995) 381-395.
38. A. Brandstadt and D. Kratsch, On the restriction of some NP-complete graph problems to permutation graphs. In Proceedings FCT’85, Ed. L. Budach, Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 199 (1985) 53-62.
39. A. Brandstadt and D. Kratsch, On domination problems on permutation and other graphs. Theoret. Comput. Sci. 54 (1987) 181-198.
40. H. Breu and D. G. Kirkpatrick, Algorithms for dominating and Steiner set problems in cocomparability graphs. Manuscript (1993).
41. H. J. Broersma, T. Kloks, D. Kratsch and H. Miiller, Independent sets in asteroidal triple-free graphs. Manuscript (1996).
42. G. J. Chang, Labelling algorithms for domination problems in sunfree chorda] graphs. Discrete Appl. Math. 22 (1988) 21-34.
43. G. J. Chang, Total domination in block graphs. Oper. Res. Lett. 8 (1989) 53-57.
44. G. J. Chang and G. L. Nemhauser, r-domination of block graphs. Oper. Res. Lett. 1(6) (1982) 214-218.
45. G. J. Chang and G. L. Nemhauser, The k-domination and k-stability on sun-free chorda! graphs. SI AM J. Algebraic Discrete Methods 5 (1984) 332-345.
46. G. J. Chang, C. Pandu-Rangan and S. R. Coorg, Weighted independent perfect domination on cocomparability graphs. In Proceedings ISAAC’93, Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 766 (1993) 506-514.
47. M. S. Chang, Weighted domination on cocomparability graphs. In Proceedings ISAAC’95, Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 1004 (1995) 122-131.
48. M. S. Chang, Efficient algorithms for the domination problems on interval and circular-arc graphs. To appear in SIAM J. Comput.
49. M. S. Chang and Y. C. Liu, Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs. Inform. Process. Lett. 48 (1993) 205-210.
50. M. S. Chang and Y. C. Liu, Polynomial algorithms for weighted perfect domination problems on interval and circular-arc graphs. J. Inform. Sci. Engineering 10 (1994) 549-568.
51. G. Cheston and G. H. Fricke, Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredun-dance. Discrete Appi. Math. 55 (1994) 241-258.
52. E. J. Cockayne, S. E. Goodman and S. T. Hedetniemi, A linear algorithm for the domination number of a tree. Inform. Process. Lett. 4 (1975) 41-44.
53. E. J. Cockayne, G. MacGillivray and C. M. Mynhardt, A linear algorithm for universal minimal dominating functions in trees. J. Combin. Math. Combin. Comput. 10 (1991) 23-31.
54. C. J. Colbourn, J. M. Keil and L. K. Stewart, Finding minimum dominating cycles in permutation graphs. Oper. Res. Lett. 4 (1985) 13-17.
55. C. J. Colbourn and L. K. Stewart, Dominating cycles in series-parallel graphs. Ars Combin. 19A (1985) 107-112.
56. C. J. Colbourn and L. K. Stewart, Permutation graphs: connected domination and Steiner trees. Discrete Math. 86 (1990) 179-189.
57. T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms. MIT Press, Cambridge, Massachusetts, 1990.
58. D. G. Corneil and J. M. Keil, A dynamic programming approach to the dominating set problem on fc-trees. SIAM J. Algebraic Discrete Methods 8 (1987) 535-543.
59. D. G. Corneil, S. Olariu and L. Stewart, Asteroidal triple-free graphs. In Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’93), Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 790 (1994) 211-224.
60. D. G. Corneil, S. Olariu and L. Stewart, A linear time algorithm to compute a dominating path in an AT-free graph. Inform. Process. Lett. 54 (1995) 253-258.
61. D. G. Corneil, S. Olariu and L. Stewart, A linear time algorithm to compute dominating pairs in asteroidal triple-free graphs. In Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP’95), Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 944 (1995) 292-302.
62. D. G. Corneil and Y. Perl, Clustering and domination in perfect graphs. Discrete Appl. Math. 9 (1984) 27-39.
63. D. G. Corneil and L. K. Stewart, Dominating sets in perfect graphs. Discrete Math. 86 (1990) 145-164.
64. M. B. Cozzens and L. L. Kelleher, Dominating cliques in graphs. Discrete Math. 86 (1990) 101-116.
65. E. Dahlhaus and P. Damaschke, The parallel solution of domination problems on chordal and strongly chordal graphs. Discrete Appl. Math. 52 (1994) 261-273.
66. P. Damaschke, H. Müller and D. Kratsch, Domination in convex and chordal bipartite graphs. Inform. Process. Lett. 36 (1990) 231-236.
67. A. K. Dewdney, Fast turing reductions between problems in NP; chapter 4; reductions between NP-complete problems. Technical Report 71, Dept. Computer Science, University of Western Ontario (1981).
68. F. F. Dragan, Dominating cliques in distance-hereditary graphs. In “Algorithm Theory -SWAT’94 " 4th Scandinavian Workshop on Algorithm Theory, Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 824 (1994) 370-381.
69. F. F. Dragan, HT-graphs: centers, connected r-domination and Steiner trees. Comput. Sci. J. Moldova (Kishinev) I (1993) 64-83.
70. F. F. Dragan and A. Brandstädt, Dominating cliques in graphs with hypertree structure. In International Symposium on Theoretical Aspects of Computer Science (STACS’94), Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 775 (1994) 735-746.
71. F. F. Dragan and F. Nicolai, r-domination problems on homogeneously orderable graphs. In Proceedings of FCT’95, Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 965 (1995) 201-210.
72. F. F. Dragan, C. F. Prisacaru and V. D. Chepoi, Location problems in graphs and the Helly property (in Russian). Discrete Math. (Moscow) 4 (1992) 67-73.
73. J. Dunbar, S. T. Hedetniemi, M. A. Henning and A. A. McRae, On the algorithmic complexity of minus domination in graphs. Discrete Appl. Math. 68 (1996) 73-84.
74. E. S. Elmallah and L. K. Stewart, Domination in polygon graphs. Congr. Numer. 77 (1990) 63-76.
75. E. S. Elmallah and L. K. Stewart, Independence and domination in polygon graphs. Discrete Appl. Math. 44 (1993) 65-77.
76. P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space. Inform. Process. Lett. 6 (1977) 80-82.
77. M. Färber, Applications of linear programming duality to problems involving independence and domination. Ph.D. Dissertation, Simon Fraser University (1981) TR-81-13.
78. M. Färber, Independent domination in chordal graphs. Oper. Res. Lett. 1 (1982) 134-138.
79. M. Färber, Domination, independent domination, and duality in strongly chordal graphs. Discrete Appl. Math. 7 (1984) 115-130.
80. M. Färber and J. M. Keil, Domination in permutation graphs. J. Algorithms 6 (1985) 309-321.
81. M. R. Fellows and M. N. Hoover, Perfect domination. Australas. J. Corn-bin. 3 (1991) 141-150.
82. G. H. Fricke, E. 0. Hare, D. P. Jacobs and A. Majumdar, On integral and fractional total domination. Congr. Numer. 77 (1990) 87-95.
83. G. H. Fricke, M. A. Henning, O. R. Oellermann and H. C. Swart, An efficient algorithm to compute the sum of two distance domination parameters. Discrete Appl. Math. 68 (1996) 85-91.
84. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
85. M. C. Golumbic and R. C. Laskar, Irredundancy in circular arc graphs. Discrete Appl. Math. 44 (1993) 79-89.
86. D. L. Grinstead and P. J. Slater, On minimum dominating sets with minimum intersection. Discrete Math. 86 (1990) 239-254.
87. D. L. Grinstead and P. J. Slater, A recurrence template for several parameters in series-parallel graphs. Discrete Appl. Math. 54 (1994) 151-168.
88. D. L. Grinstead, P. J. Slater, N. A. Sherwani and N. D. Holmes, Efficient edge domination problems in graphs. Inform. Process. Lett. 48 (1993) 221-228.
89. J. H. Hattingh, M. A. Henning and P. J. Slater, On the algorithmic complexity of signed domination in graphs. Australas. J. Combin. 12 (1995) 101-112.
90. X. He and Y. Yesha, Efficient parallel algorithms for r-dominating set and p-center problems on trees. Algorithmica 5 (1990) 129-145.
91. S. M. Hedetniemi, S. T. Hedetniemi and D. P. Jacobs, Private domination: theory and algorithms. Congr. Numer. 79 (1990) 147-157.
92. S. M. Hedetniemi, S. T. Hedetniemi and R. C. Laskar, Domination in trees: models and algorithms. Graph Theory with Applications to Algorithms and Computer Science, Eds. Y. Alavi et al., Wiley, (1984) 423-442.
93. S. T. Hedetniemi, R. C. Laskar and J. Pfaff, A linear algorithm for finding a minimum dominating set in a cactus. Discrete Appl. Math. 13 (1986) 287-292.
94. W. Hsu and K. Tsai, Linear time algorithms on circular-arc graphs. Inform. Process. Lett. 40 (1991) 123-129.
95. O. H. Ibarra and Q. Zheng, Some efficient algorithms for permutation graphs. J. Algorithms 16 (1994) 453-469.
96. M. S. Jacobson and K. Peters, Complexity questions for n-domination and related parameters. Congr. Numer. 68 (1989) 7-22.
97. D. S. Johnson, The NP-completeness column: an ongoing guide. J. Algorithms 6 (1985) 291-305,434-451.
98. J. M. Keil, The complexity of domination problems in circle graphs. Discrete Appl. Math. 42 (1993) 51-63.
99. J. M. Keil and D. Schaefer, An optimal algorithm for finding dominating cycles circular-arc graphs. Discrete Appl. Math. 36 (1992) 25-34.
100. T. Kikuno, N. Yoshida and Y. Kakuda, A linear algorithm for the domination number of a series-parallel graph. Discrete Appl. Math. 5 (1983) 299-311.
101. E. Köhler, Connected domination on trapezoid graphs in O(n) time. Manuscript (1996).
102. D. Kratsch, Finding dominating cliques efficienctly, in strongly chordal graphs and undirected path graphs. Discrete Math. 86 (1990) 225-238.
103. D. Kratsch, Domination and total domination in asteroidal triple-free graphs. Technical Report, Math/Inf/96/25, F.-Schiller-Universität, Jena (1996).
104. D. Kratsch, P. Damaschke and A. Lubiw, Dominating cliques in chordal graphs. Discrete Math. 128 (1994) 269-275.
105. D. Kratsch and L. Stewart, Domination on cocomparability graphs. SIAM J. Discrete Math. 6(3) (1993) 400-417.
106. D. Kratsch and L. Stewart, Total domination and transformation. Manuscript (1996).
107. R. C. Laskar and J. Pfaff, Domination and irredundance in split graphs. Technical Report 430, Dept. Mathematical Sciences, Clemson University (1983).
108. R. C. Laskar, J. Pfaff, S. M. Hedetniemi and S. T. Hedetniemi, On the algorithmic complexity of total domination. SIAM J. Algebraic Discrete Methods 5 (1984) 420-425.
109. E. L. Lawler and P. J. Slater, A linear time algorithm for finding an optimal dominating subforest of a tree. Graph Theory with Applications to Algorithms and Computer Science, Wiley, New York (1985) 501-506.
110. Y. D. Liang, Permutation graphs: connected domination and steiner trees revisited. Manuscript (1992).
111. Y. D. Liang, Dominations in trapezoid graphs. Inform. Process. Lett. 52 (1994) 309-315.
112. Y. D. Liang, Steiner set and connected domination in trapezoid graphs. Inform. Process. Lett. 56 (1995) 165-171.
113. Y. D. Liang and C. Rhee, Linear algorithms for two independent set problems in permutation graphs. In Proc. of 22nd Computer Science Conference (1994) 90-93.
114. Y. Liang, C. Rhee, S. K. Dall and S. Lakshmivarahan, A new approach for the domination problem on permutation graphs. Inform. Process. Lett. 37 (1991) 219-224.
115. E. Loukakis, Two algorithms for determining a minimum independent dominating set. Internal. J. Comput. Math. 15 (1984) 213-229.
116. T. L. Lu, P. H. Ho and G. J. Chang, The domatic number problem in interval graphs. SIAM J. Discrete Math. 3 (1990) 531-536.
117. G. K. Manacher and T. A. Mankus, Incorporating negative-weight vertices in certain vertex-search graph algorithms. Inform. Process. Lett. 42 (1992) 293-294.
118. G. K. Manacher and T. A. Mankus, Finding a domatic partition of an interval graph in time O(n). SIAM J. Discrete Math. 9 (1996) 167-172.
119. R. M. McConnell and J. P. Spinrad, Modular decomposition and transitive orientation. Manuscript (1995).
120. A. A. McRae and S. T. Hedetniemi, Finding n-independent dominating sets. Congr. Numer. 85 (1991) 235-244.
121. S. Mitchell, S. T. Hedetniemi and S. Goodman, Some linear algorithms on trees. Congr. Numer. 14 (1975) 467-483.
122. M. Moscarini, Doubly chordal graphs, Steiner trees, and connected domination. Networks 23 (1993) 59-69.
123. H. Müller and A. Brandstädt, The NP-completeness of STEINER TREE and DOMINATING SET for chordal bipartite graphs. Theoret. Comput. Sci. 53 (1987) 257-265.
124. K. S. Natarajan and L. J. White, Optimum domination in weighted trees. Inform. Process. Lett. 7 (1978) 261-265.
125. F. Nicolai and T. Szymzcak, Domination and homogeneous sets -a linear time algorithm for distance-hereditary graphs. Technical Report SM-DU-336, Universität Duisburg (1996).
126. R. Paige and R. E. Tarjan, Three partition refinement algorithms. SI AM J. Comput. 6 (1987) 973-989.
127. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Networks and Complexity. Prentice Hall, Englewood Cliffs, New Jersey, 1982.
128. S. L. Peng and M. S. Chang, A simple linear time algorithm for the domatic partition problem on strongly chordal graphs. Inform. Process. Lett. 43 (1992) 297-300.
129. J. Pfaff, R. Laskar and S. T. Hedetniemi, NP-completeness of total and connected domination, and irredundance for bipartite graphs. Technical Report 428, Dept. Mathematical Sciences, Clemson University (1983).
130. J. Pfaff, R. Laskar and S. T. Hedetniemi, Linear algorithms for independent domination and total domination in series-parallel graphs. Congr. Numer. 45 (1984) 71-82.
131. A. Proskurowski, Minimum dominating cycles in 2-trees. Internal. J. Comput. Inform. Sei. 8 (1979) 405-417.
132. A. Proskurowski and M. M. Syslo, Minimum dominating cycles in outer-planar graphs. Internal. J. Comput. Inform. Sei. 10 (1981) 127-139.
133. G. Ramalingam and C. Pandu Rangan, Total domination in interval graphs revisited, Inform. Process. Lett. 27 (1988) 17-21.
134. G. Ramalingam and C. Pandu Rangan, A unified approach to domination problems in interval graphs. Inform. Process. Lett. 27 (1988) 271-274.
135. A. S. Rao and C. Pandu Rangan, Optimal parallel algorithms on circular-arc graphs. Inform. Process. Lett. 33 (1989) 147-156.
136. A. S. Rao and C. Pandu Rangan, Linear algorithm for domatic number problem on interval graphs. Inform. Process. Lett. 33 (1989-90) 29-33.
137. 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.
138. F. S. Roberts, Graph Theory and Its Applications to Problems of Society. CBMS-NSF Monograph, Vol. 29, SIAM Publications, 1978.
139. M. Skowroiiska and M. M. Syslo, Dominating cycles in Halin graphs. Discrete Math. 86 (1990) 215-224.
140. P. J. Slater, P-domination in graphs. J. Assoc. Comput. Mach. 23 (1976) 446-450.
141. J. Spinrad, On comparability and permutation graphs. SIAM J. Comput. 14 (1985) 658-670.
142. J. Spinrad, Doubly lexical ordering of dense 0 -1 matrices. Inform. Process. Lett. 45 (1993) 229-235.
143. R. Sridhar and S. S. Iyengar, Efficient parallel algorithms for domination problems on strongly chordal graphs. Manuscript.
144. A. Srinivasan and C. Pandu Rangan, Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs. Theo-ret. Comput. Sci. 91 (1991) 1-21.
145. R. E. Tarjan and M. Yannakakis, Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 3 (1984) 566-579.
146. J. A. Telle, Complexity of domination-type problems in graphs. Nordic J. Comput. 1 (1994) 157-171.
147. J. A. Telle and A. Proskurowski, Practical algorithms on partial A:-trees with an application to domination-type problems. In Proc. Workshop on Algorithms and Data Structures (WADS’93), Eds. F. Dehne, J. R. Sack, N. Santoro and S. Whitesides, Springer-Verlag, Berlin, Lecture Notes in Compui. Sei. 709 (1993) 610-621.
148. J. A. Telle and A. Proskurowski, Efficient sets in partial k-trees. Discrete Appl. Math. 44 (1993) 109-117.
149. W. T. Trotter, Combinatorics and Partially Ordered Sets: Dimension Theory. The John Hopkins University Press, Baltimore, Maryland, 1992.
150. K. Tsai and W. L. Hsu, Fast algorithms for the dominating set problem on permutation graphs. Algorithmica 9 (1993) 109-117.
151. C. Tsouros and M. Satratzemi, Tree search algorithms for the dominating vertex set problem. Internat. J. Computer Math. 47 (1993) 127-133.
152. K. White, M. Färber and W. Pulleyblank, Steiner trees, connected domination and strongly chorda! graphs. Networks 15 (1985) 109-124.
153. T. V. Wimer, Linear algorithms on K-terminal graphs. Ph.D. Dissertation, Clemson University (1987).
154. M. Yannakakis and F. Gavril, Edge dominating sets in graphs. SIAM J. Appl. Math. 38 (1980) 264-272.
155. C. Yen and R. C. T. Lee, The weighted perfect domination problem. Inform. Process. Lett. 35 (1990) 295-299.