Exponential time algorithms for the minimum dominating set problem on some graph classes

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

Volumn 4059 LNCS, Issue , 2006, Pages 148-159

  Gaspers, Serge ^a   Kratsch, Dieter ^b   Liedloff, Mathieu ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; TIME DOMAIN ANALYSIS;

C-DENSE GRAPHS; CHORDAL GRAPHS; EXPONENTIAL TIME ALGORITHM; MINIMUM DOMINATING SET PROBLEM;

GRAPH THEORY;

EID: 33746423526     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11785293_16     Document Type: Conference Paper

References (19)

1. Alber, J., H. L. Bodlaender, H. Fernau, T. Kloks and R. Niedermeier, Fixed parameter algorithms for dominating set and related problems on planar graphs, Algorithmica 33, (2002), pp. 461-493.
2. Bertossi, A. A., Dominating sets for split and bipartite graphs., Inform. Process. Lett. 19, (1984), pp. 37-40.
3. Blair, J. R. S. and B. W. Peyton, An introduction to chordal graphs and clique trees, Graph theory and sparse matrix computation, IMA Vol. Math. Appl., vol. 56, Springer, 1993, pp. 1-29.
4. Bodlaender, H. L. and D. M. Thilikos, Graphs with branchwidth at most three, J. Algorithms 32, (1999), pp. 167-194.
5. Booth, K. S. and J. H. Johnson, Dominating sets in chordal graphs, SIAM J. Comput. 11, (1982), pp. 191-199.
6. Brandstadt, A., V. Le, and J. P. Spinrad, Graph classes: A survey, SIAM Monogr. Discrete Math. Appl., Philadelphia, 1999.
7. Fomin, F.V., and K. Høie, Pathwidth of cubic graphs and exact algorithms, Technical Report 298, Department of Informatics, University of Bergen, Norway, 2005.
8. Fomin, F.V., F. Grandoni, D. Kratsch, Measure and conquer: Domination - A case study, Proceedings of ICALP 2005, LNCS 3380, (2005), pp. 192-203.
9. Fomin, F.V., F. Grandoni, D. Kratsch, Some new techniques in design and analysis of exact (exponential) algorithms, Bull. EATCS, 87, (2005), pp. 47-77.
10. 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.
11. Golumbic, M. C., Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.
12. Grandoni, F., A note on the complexity of minimum dominating set, J. Discrete Algorithms, to appear.
13. Keil, J. M., The complexity of domination problems in circle graphs, Discrete Appl. Math. 42, (1993), pp. 51-63.
14. Kloks, T., Treewidth. Computations and approximation, LNCS 842, Springer-Verlag, Berlin, 1994.
15. Kloks, T., Treewidth of Circle Graphs, Internat. J. Found. Comput. Sci. 7, (1996) pp. 111-120.
16. Randerath, B., and I. Schiermeyer, Exact algorithms for Minimum Dominating Set, Technical Report zaik-469, Zentrum fur Angewandte Informatik, Köln, Germany, 2004.
17. Robertson, N. and P. D. Seymour, Graph Minors. II. Algorithmic Aspects of Tree-Width, J. Algorithms 7, (1986), pp. 309-322.
18. Schiermeyer, I., Problems remaining NP-complete for sparse or dense graphs, Discuss. Math. Graph Theory 15, (1995), pp. 33-41.
19. Woeginger, G.J., Exact algorithms for NP-hard problems: A survey, Combinatorial Optimization - Eureka, You Shrink!, LNCS 2570, (2003), pp. 185-207.