An exact algorithm for the minimum dominating clique problem

Theoretical Computer Science

Volumn 385, Issue 1-3, 2007, Pages 226-240

  Kratsch, Dieter ^a   Liedloff, Mathieu ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Dominating clique; Dominating set; Exponential time algorithms; Graph algorithms

Indexed keywords

ASYMPTOTIC STABILITY; GRAPH THEORY; PROBLEM SOLVING; SET THEORY;

DOMINATING CLIQUE; DOMINATING SET; EXPONENTIAL TIME ALGORITHMS; GRAPH ALGORITHMS;

ALGORITHMS;

EID: 34548682307     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.06.014     Document Type: Article

References (28)

1. Cozzens M.B., and Kelleher L.L. Dominating cliques in graphs. Discrete Mathematics 86 (1990) 101-116
2. J. Culberson, Y. Gao, C. Anton, Phase transitions of dominating clique problem and their implications to satisfiability search, in: Proceedings of IJCAI 2005, pp. 78-83
3. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer-Verlag, New York
4. Fomin F.V., Grandoni F., and Kratsch D. Measure and conquer: Domination - A case study. Proceedings of ICALP 2005. LNCS vol. 3380 (2005), Springer-Verlag, Berlin 192-203
5. Fomin F.V., Grandoni F., and Kratsch D. Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the EATCS 87 (2005) 47-77
6. n. Proceedings of FSTTCS 2006. LNCS vol. 4337 (2006), Springer-Verlag, Berlin 152-163
7. Fomin F.V., Kratsch D., and Woeginger G.J. Exact (exponential) algorithms for the dominating set problem. Proceedings of WG 2004. LNCS vol. 3353 (2004), Springer-Verlag, Berlin 245-256
8. Garey M.R., and Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Co., San Francisco
9. Gaspers S., Kratsch D., and Liedloff M. Exponential time algorithms for the minimum dominating set problem on some graph classes. Proceedings of SWAT 2006. LNCS vol. 4059 (2006), Springer-Verlag, Berlin 148-159
10. Gaspers S., and Liedloff M. A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs. Proceedings of WG 2006. LNCS vol. 4271 (2006), Springer-Verlag, Berlin 78-89
11. Grandoni F. A note on the complexity of minimum dominating set. Journal of Discrete Algorithms 4 (2006) 209-214
12. Haynes T.W., Hedetniemi S.T., and Slater P.J. Fundamentals of Domination in Graphs (1998), Marcel Dekker Inc., New York
13. Haynes T.W., Hedetniemi S.T., and Slater P.J. Domination in Graphs: Advanced Topics (1998), Marcel Dekker Inc., New York
14. Held M., and Karp R.M. A dynamic programming approach to sequencing problems. Journal of SIAM (1962) 196-210
15. Iwama K. Worst-case upper bounds for ksat. Bulletin of the EATCS 82 (2004) 61-71
16. Johnson D.S., Yannakakis M., and Papadimitriou C.H. On generating all maximal independent sets. Information Processing Letters 27 (1988) 119-123
17. Kratsch D. Algorithms. In: Haynes T., Hedetniemi S., and Slater P. (Eds). Domination in Graphs: Advanced Topics (1998), Marcel Dekker 191-231
18. Lawler E.L. A note on the complexity of the chromatic number problem. Information Processing Letters 5 (1976) 66-67
19. Moon J.W., and Moser L. On cliques in graphs. Israel Journal of Mathematics 3 (1965) 23-28
20. B. Randerath, I. Schiermeyer, Exact algorithms for minimum dominating set, Technical Report zaik-469, Zentrum für Angewandte Informatik, Köln, Germany, April 2004
21. Razgon I. Exact computation of maximum induced forest. Proceedings of SWAT 2006. LNCS vol. 4059 (2006), Springer-Verlag, Berlin 160-171
22. Robson J.M. Algorithms for maximum independent sets. Journal of Algorithms 7 (1986) 425-440
23. Schöning U. Algorithmics in exponential time. Proceedings of STACS 2005. LNCS vol. 3404 (2005), Springer-Verlag, Berlin 36-43
24. Tarjan R., and Trojanowski A. Finding a maximum independent set. SIAM Journal on Computing 6 (1977) 537-546
25. Villanger Y. Improved exponential-time algorithms for treewidth and minimum fill-in. Proceedings of LATIN 2006. LNCS vol. 3887 (2005), Springer-Verlag, Berlin 800-811
26. West D. Introduction to Graph Theory (1996), Prentice Hall
27. Woeginger G.J. Exact algorithms for NP-hard problems: A survey. Combinatorial Optimization - Eureka, You Shrink!. LNCS vol. 2570 (2003), Springer-Verlag, Berlin 185-207
28. Woeginger G.J. Space and time complexity of exact algorithms: Some open problems. Proceedings of IWPEC 2004. LNCS vol. 3162 (2004), Springer-Verlag, Berlin 281-290