Bounding the number of minimal dominating sets: A measure and conquer approach

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

Volumn 3827 LNCS, Issue , 2005, Pages 573-582

  Fomin, Fedor V ^a   Grandoni, Fabrizio ^b   Pyatkin, Artem V ^a   Stepanov, Alexey A ^a  

^a UNIVERSITY OF BERGEN   (Norway)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Domatic number; Exact (exponential) algorithms; Minimum dominating set; Minimum set cover; Weighted dominating set

Indexed keywords

ALGORITHMS; GRAPH THEORY; NUMBER THEORY; PROBLEM SOLVING;

DOMATIC NUMBER; EXACT (EXPONENTIAL) ALGORITHMS; MINIMUM DOMINATING SET; MINIMUM SET COVER; WEIGHTED DOMINATING SET;

SET THEORY;

EID: 33744958900     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_58     Document Type: Conference Paper

References (23)

1. R. BEIGEL, Finding maximum independent sets in sparse and general graphs, in Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA'1999), ACM and SIAM, 1999, pp. 856-857.
2. L. M. BRÈGMAN, Certain properties of nonnegative matrices and their permanents, Doklady Akademii Nauk BSSR, 211 (1973), pp. 27-30.
3. M. BYSKOV AND D. EPPSTEIN, An algorithm for enumerating maximal bipartite subgraphs, manuscript, (2004).
4. n algorithm for k-SAT based on local search, Theoretical Computer Science, 289 (2002), pp. 69-83.
5. J. EDMONDS AND E. L. JOHNSON, Matching: A well-solved class of integer linear programs, in Combinatorial Structures and their Applications, Gordon and Breach, New York, 1970, pp. 89-92.
6. G. P. EGORYCHEV, Proof of the van der Waerden conjecture for permanents, Sibirsk. Mat. Zh., 22 (1981), pp. 65-71, 225.
7. D. EPPSTEIN, Small maximal independent sets and faster exact graph coloring, Journal of Graph Algorithms and Applications, 7 (2003), pp. 131-140.
8. D. EPPSTEIN, Quasiconvex analysis of backtracking algorithms, in Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA'2004), ACM and SIAM, 2004, pp. 781-790.
9. F. V. FOMIN, F. GRANDONI, AND D. KRATSCH, Measure and conquer; Domination - a case study, in Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), LNCS, Springer, Berlin, 2005 (to appear).
10. F. V. FOMIN, D. KRATSCH, AND I. TODINCA, Exact algorithms for treewidtii and minimum fill-in, in Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), vol. 3142 of LNCS, Springer, Berlin, 2004, pp. 568-580.
11. F. V. FOMIN, D. KRATSCH, AND G. J. WOEGINGER, Exact (exponential) algorithms for the dominating set problem, in Proceedings of the 30th Workshop on Graph Theoretic Concepts in Computer Science (WG 2004), vol. 3353 of LNCS, Springer, Berlin, 2004, pp. 245-256.
12. F. GRANDONI, Exact algorithms for hard graph problems, PhD thesis, Università di Roma "Tor Vergata", Roma, Italy, (March, 2004).
13. _, A note on the complexity of minimum dominating set, Journal of Discrete Algorithms, (to appear).
14. T. W. HAYNES AND S. T. HEDETNIEMI, eds., Domination in graphs, Marcel Dekker Inc., New York, 1998.
15. M. HELD AND R. M. KARP, A dynamic programming approach to sequencing problems, Journal of SIAM, 10 (1962), pp. 196-210.
16. J. IWAMA AND S. TAMAKI, Improved upper bounds for 3-sat, in 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), ACM and SIAM, 2004, p. 328.
17. E. L. LAWLER, A note on the complexity of the chromatic number problem, Information Processing Lett., 5 (1976), pp. 66-67.
18. J. W. MOON AND L. MOSER, On cliques in graphs, Israel Journal of Mathematics, 3 (1965), pp. 23-28.
19. B. RANDERATH AND I. SCHIERMEYER, Exact algorithms for MINIMUM DOMINATING SET, Technical Report zaik-469, Zentrum für Angewandte Informatik Köln, Germany, 2004.
20. n algorithm for the three domatic number problem, in Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), LNCS, Springer, Berlin, 2005, p. to appear.
21. R. E. TARJAN AND A. E. TROJANOWSKI, Finding a maximum independent set, SIAM Journal on Computing, 6 (1977), pp. 537-546.
22. B. VAN DER WAERDEN, Problem 45, Jahresber. Deutsch. Math.-Verein., 35 (1926), p. 117.
23. G. WOEGINGER, Exact algorithms for NP-hard problems; A survey, in Combinatorial Optimization - Eureka, you shrinkl, vol. 2570 of LNCS, Springer-Verlag, Berlin, 2003, pp. 185-207.