An exact algorithm for the minimum dominating clique problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4169 LNCS, Issue , 2006, Pages 130-141

  Kratsch, Dieter ^a   Liedloff, Mathieu ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY; PROBLEM SOLVING;

MAXIMUM DOMINATING CLIQUE; TIME ANALYSIS;

SET THEORY;

EID: 33750264816     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_12     Document Type: Conference Paper

References (24)

1. Cozzens, M. B., and L. L. Kelleher, Dominating cliques in graphs, Discrete Math. 86 (1990), pp. 101-116.
2. Culberson, J., Y. Gao, and C. Anton, Phase Transitions of Dominating Clique Problem and Their Implications to Satisfiability Search, Proc. IJCAI2005, pp. 78-83.
3. Fomin, F. V., F. Grandoni, and D. Kratsch, Measure and conquer: Domination - A case study, Proc. ICALP 2005, LNCS 3380 (2005), pp. 192-203.
4. Fomin, F. V., F. Grandoni, and D. Kratsch, Some new techniques in design and analysis of exact (exponential) algorithms, Bull. EATCS 87 (2005), pp. 47-77.
5. Fomin, F. V., D. Kratsch, and G. J. Woeginger, Exact (exponential) algorithms for the dominating set problem, Proc. WG 2004, LNCS 3353 (2004), pp. 245-256.
6. Garey, M. R. and D. S. Johnson, Computers and intractability. A guide to the theory of NP-completeness. W.H. Freeman and Co., San Francisco, 1979.
7. Gaspers, S., and M. Liedloff, A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs, Proc. WG 2006, to appear.
8. Grandoni, F., A note on the complexity of minimum dominating set, J. Discrete Algorithms 4 (2006), pp. 209-214.
9. Haynes T. W., S. T. Hedetniemi, and P. J. Slater, Fundamentals of domination in graphs. Marcel Dekker Inc., New York, 1998.
10. Haynes T. W., S. T. Hedetniemi, and P. J. Slater, Domination in graphs: Advanced Topics. Marcel Dekker Inc., New York, 1998.
11. Held M. and R.M. Karp, A dynamic programming approach to sequencing problems, Journal of SIAM (1962), pp. 196-210.
12. Iwama K., Worst-case upper bounds for ksat, Bull. EATCS 82 (2004), pp. 61-71.
13. Johnson, D. S., M. Yannakakis, and C. H. Papadimitriou, On generating all maximal independent sets, Inf. Process. Lett., 27, (1988), pp. 119-123.
14. Kratsch, D., Algorithms, in Domination in Graphs: Advanced Topics, T. Haynes, S. Hedetniemi, P. Slater, (eds.), Marcel Dekker, 1998, pp. 191-231.
15. Lawler E. L., A note on the complexity of the chromatic number problem. Inform. Process. Lett. 5(3) (1976), pp. 66-67.
16. Moon, J. W., and L. Moser, On cliques in graphs. Israel J. Math., 3, (1965), pp. 23-28.
17. Randerath, B., and I. Schiermeyer, Exact algorithms for Minimum Dominating Set, Technical Report zaik-469, Zentrum fur Angewandte Informatik, Koln, Germany, April 2004.
18. Razgon, I., Exact computation of maximum induced forest, Proc. SWAT 2006, to appear.
19. Robson J. M., Algorithms for maximum independent sets, J. Algorithms 7 (1986), pp. 425-440.
20. Schöning U., Algorithmics in exponential time, Proc. STACS 2005, LNCS 3404 (2005), pp. 36-43.
21. Tarjan R. and A. Trojanowski, Finding a maximum independent set, SIAM J. Comput. 6(3) (1977), pp. 537-546.
22. Villanger Y., Improved exponential-time algorithms for treewidth and minimum fill-in. Proc. LATIN 2006 LNCS 3887 (2006), pp. 800-811.
23. Woeginger, G. J., Exact algorithms for NP-hard problems: A survey, Combinatorial Optimization - Eureka, You Shrink!, LNCS 2570 (2003), pp. 185-207.
24. Woeginger, G. J., Space and time complexity of exact algorithms: Some open problems, Proc. IWPEC 2004, LNCS 3162 (2004), pp. 281-290.