Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs

Annals of Discrete Mathematics

Volumn 48, Issue C, 1991, Pages 225-238

  Kratsch, Dieter ^a  

^a Universitatshochhaus ^*  (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040555790     PISSN: 01675060     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0167-5060(08)71052-5     Document Type: Article

References (25)

1. Anstee, R.P., Farber, M., Characterizations of totally balanced matrices. J. Algorithms 5 (1984), 215–230.
2. Berge, C., Graphs, 1985, North-Holland, Amsterdam.
3. Brandstadt, A., On the domination problem for bipartite graph. Bodendieck, R., Henn, R., (eds.) Topics in Combinatorics and Graph Theory, 1990, Physica, Heidelberg, 145–152.
4. Brandstadt, A., Kratsch, D., Domination problems on permutation and other graphs. Theoret. Comput. Sci. 54 (1987), 181–198.
5. Brandstädt, A., Kratsch, D., On the restriction of some NP-complete graph problems to permutation graphs. Budach, L., (eds.) Proceedings of the FCT '85 Conference, Lecture Notes in Computer Science 199, 1985, Springer, Berlin, 53–62.
6. Cornell, D.G., Perl, Y., Clustering and domination in perfect graphs. Discrete Appl. Math. 9 (1984), 27–39.
7. D.G. Cornell, L.K. Stewart. Dominating sets in perfect graphs, this volume.
8. M.B. Cozzens, L.L. Kelleher. Dominating cliques in graphs, this volume.
9. M. Farber. Applications of L.p. duality to problems involving independence and domination, Ph.D. Thesis, Rutgers University, New Brunswick, NJ, 1982.
10. Farber, M., Characterizations of strongly chordal graphs. Discrete Math. 43 (1983), 173–189.
11. Garey, M.R., Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979, Freeman, New York.
12. Gavril, F., The intersection graphs of subtrees in a tree are exactly the chordal graphs. J. Combin. Theory Ser. B 16 (1974), 47–56.
13. Gavril, F., A recognition algorithm for the intersection graphs of directed paths in directed trees. Discrete Math. 13 (1975), 237–249.
14. Gavril, F., A recognition algorithm for the intersection graphs of paths in a tree. Discrete Math. 23 (1978), 211–227.
15. Golumbic, M.C., Algorithmic Graph Theory and Perfect Graphs, 1980, Academic Press, New York.
16. Johnson, D.S., The NP-completeness column: An ongoing guide. J. Algorithms, series of papers, started in, 2(4), 1981.
17. Johnson, D.S., The NP-completeness column: An ongoing guide. J. Algorithms 5 (1984), 147–160.
18. Johnson, D.S., The NP-completeness column: An ongoing guide 16th edition. J. Algorithms 6 (1985), 434–451.
19. L.L. Kelleher, Domination in graphs and its applications to social network theory, Ph.D. Thesis, Northeastern University, Boston, MA, 1985.
20. D. Kratsch, A linear time algorithm for the minimum dominating clique problem on strongly chordal graphs, Forschungsergebnisse der FSU, Jena, N/87/29, 1987.
21. D. Kratsch, P. Damaschke and A. Lubiw, Dominating cliques in chordal graphs, submitted to Discrete Math.
22. S. Micali and V.V. Vazirani, An O(V1/2) algorithm for finding maximum matching in general graphs, in: 21st Annual Symposium on Foundations of Computer Science (Syracuse, 1980), (IEEE Computer Society Press, New York, 1980) 17–27.
23. Monma, C.L., Wei, V.K., Intersection graphs of path in a tree. J. Combin. Theory Ser. B 41 (1986), 141–148.
24. Paige, R., Tarjan, R.E., Three partition refinement algorithms. SIAM J. Comput. 16 (1987), 973–989.
25. Special issue on interval graphs and related topics. Discrete Math. 55:2 (1985), 113–244.