An improved exact algorithm for the domatic number problem

Information Processing Letters

Volumn 101, Issue 3, 2007, Pages 101-106

  Riege, Tobias ^a   Rothe, Jörg ^a   Spakowski, Holger ^a   Yamamoto, Masaki ^b  

^a HEINRICH HEINE UNIVERSITY   (Germany)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Domatic number problem; Exact algorithms; Graph algorithms; Randomized algorithms

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

DOMATIC NUMBER PROBLEMS; EXACT ALGORITHMS; GRAPH ALGORITHMS; RANDOMIZED ALGORITHMS;

NUMBER THEORY;

EID: 33845231162     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.08.010     Document Type: Article

References (21)

1. A. Björklund, T. Husfeldt, Inclusion-exclusion algorithms for counting set partitions, in: Proceedings of the 47th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, October 2006, in press
2. Bonuccelli M. Dominating sets and dominating number of circular arc graphs. Discrete Applied Mathematics 12 (1985) 203-213
3. Cockayne E., and Hedetniemi S. Towards a theory of domination in graphs. Networks 7 (1977) 247-261
4. Farber M. Domination, independent domination, and duality in strongly chordal graphs. Discrete Applied Mathematics 7 (1984) 115-130
5. F. Fomin, F. Grandoni, D. Kratsch, Measure and conquer: Domination-A case study, in: Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming, 2005, pp. 191-203
6. F. Fomin, F. Grandoni, A. Pyatkin, A. Stepanov, Bounding the number of minimal dominating sets: A measure and conquer approach, in: Proceedings of the 16th International Symposium on Algorithms and Computation, 2005, pp. 573-582
7. Feige U., Halldórsson M., and Kortsarz G. Approximating the domatic number. Proceedings of the 32nd ACM Symposium on Theory of Computing (May 2000), ACM Press 134-143
8. Feige U., Halldórsson M., Kortsarz G., and Srinivasan A. Approximating the domatic number. SIAM Journal on Computing 32 1 (2002) 172-195
9. Garey M., and Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company, New York
10. Hirsch E. New worst-case upper bounds for SAT. Journal of Automated Reasoning 24 (2000) 397-420
11. Heggernes P., and Telle J. Partitioning graphs into generalized dominating sets. Nordic Journal of Computing 5 2 (1998) 128-142
12. Iwama K., and Tamaki S. Improved upper bounds for 3-SAT. In: Munro J. (Ed). Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (January 2004), Society for Industrial and Applied Mathematics 328-329
13. Kaplan H., and Shamir R. The domatic number problem on some perfect graph families. Information Processing Letters 49 1 (1994) 51-56
14. Lawler E. A note on the complexity of the chromatic number problem. Information Processing Letters 5 3 (1976) 66-67
15. Paturi R., Pudlák P., Saks M., and Zane F. An improved exponential-time algorithm for k-SAT. Proceedings of the 39th IEEE Symposium on Foundations of Computer Science (November 1998), IEEE Computer Society Press 628-637
16. Riege T., and Rothe J. Complexity of the exact domatic number problem and of the exact conveyor flow shop problem. Theory of Computing Systems 39 5 (2006) 635-668
17. n algorithm for the three domatic number problem. Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science vol. 3618 (August 2005), Springer-Verlag, Berlin 733-744
18. Schöning U. A probabilistic algorithm for k-SAT and constraint satisfaction problems. Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (October 1999), IEEE Computer Society Press 410-414
19. Schöning U. Algorithmics in exponential time. Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science vol. 3404 (2005), Springer-Verlag, Berlin 36-43
20. Woeginger G. Exact algorithms for NP-hard problems. In: Jünger M., Reinelt G., and Rinaldi G. (Eds). Combinatorical Optimization: "Eureka, you shrink!". Lecture Notes in Computer Science vol. 2570 (2003), Springer-Verlag, Berlin 185-207
21. m)-time deterministic algorithm for SAT. Proceedings of the 16th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science vol. 3827 (2005), Springer-Verlag, Berlin 644-653