A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs

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

Volumn 4271 LNCS, Issue , 2006, Pages 78-89

  Gaspers, Serge ^a   Liedloff, Mathieu ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SCIENCE; GRAPH THEORY; SET THEORY;

BRANCH AND REDUCE ALGORITHM; INDEPENDENT DOMINATING SET; MINIMUM INDEPENDENT DOMINATING SET; WORST CASE RUNNING TIME;

ALGORITHMS;

EID: 33845541648     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11917496_8     Document Type: Conference Paper

References (18)

1. Broersma, H., T. Kloks, D. Kratsch, and H. Müller, Independent sets in Asteroidal Triple-free graphs, SIAM J. Discrete Math., 12, (1999), pp. 276-287.
2. Chang, M.-S., Efficient algorithms for the domination problems on interval and circular-arc graphs, SIAM J. Comput., 27, (1998), pp. 1671-1694.
3. Corneil, D.-G. and Y. Perl, Clustering and domination in perfect graphs, Discrete. Appl. Math., 9, (1984), pp. 27-39.
4. Farber, M., Independent domination in chordal graphs, Operation Research Letters, 1, (1982), pp. 134-138.
5. 0.288n) Independent Set Algorithm, Proceedings of SODA 2006, (2006), pp. 18-25.
6. Fomin, F. V., F. Grandoni, and D. Kratsch, Measure and conquer: Domination - A case study, Proceedings of ICALP 2005, LNCS 3380, (2005), pp. 192-203.
7. Fomin, F. V., F. Grandoni, and D. Kratsch, Some new techniques in design and analysis of exact (exponential) algorithms, Bulletin of the EATCS, 87, (2005), pp. 47-77.
8. Fomin, F. V., D. Kratsch, and G. J. Woeginger, Exact (exponential) algorithms for the dominating set problem, Proceedings of WG 2004, LNCS 3353, (2004), pp. 245-256.
9. Grandoni, F., A note on the complexity of minimum dominating set, J. Discrete Algorithms, 4, (2006), pp. 209-214.
10. Halldórsson, M. M., Approximating the Minimum Maximal Independence Number, Inf. Process. Lett., 46, (1993), pp. 169-172.
11. Johnson, D. S., M. Yannakakis, and C. H. Papadimitriou, On generating all maximal independent sets, Inf. Process. Lett., 27, (1988), pp. 119-123.
12. Kratsch, D., and L. Stewart, Domination on Cocomparability Graphs, SIAM J. Discrete Math., 6, (1993), pp. 400-417.
13. Moon, J. W., and L. Moser, On cliques in graphs, Israel J. Math., 3, (1965), pp. 23-28.
14. Randerath, B., and I. Schiermeyer, Exact algorithms for Minimum Dominating Set, Technical Report zaik-469, Zentrum für Angewandte Informatik, Köln, Germany, April 2004.
15. Robson, J. M., Algorithms for maximum independent sets, J. Algorithms, 7, (1986), pp. 425-440.
16. n/4), Technical Report 1251-01, LaBRI, Université Bordeaux I, 2001.
17. Tarjan, R. E., and A. E. Trojanowski, Finding a maximum independent set, SIAM J. Comput., 6, (1977), pp. 537-546.
18. Woeginger, G. J., Exact algorithms for NP-hard problems: A survey, Combinatorial Optimization - Eureka, You Shrinkl, LNCS 2570, (2003), pp. 185-207.