Abstract
Inclusion/exclusion and measure and conquer are two of the most important recent new developments in the field of exact exponential time algorithms. Algorithms that combine both techniques have been found very recently, but thus far always use exponential space.
In this paper, we try to obtain fast exponential time algorithms for graph domination problems using only polynomial space. Using a novel treewidth based annotation procedure to deal with sparse instances, we give an algorithm that counts the number of dominating sets of each size κ in a graph in \(\mathcal{O}(1.5673^n)\) time and polynomial space. We also give an algorithm for the domatic number problem running in \(\mathcal{O}O(2.7139^n)\) time and polynomial space.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bax, E.T.: Inclusion and exclusion algorithm for the Hamiltonian path problem. Information Processing Letters 47(4), 203–207 (1993)
Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM Journal on Computing 39, 546–563 (2009)
Björklund, A., Husfeldt, T.: Exact graph coloring using inclusion-exclusion. Encyclopedia of Algorithms (2008)
Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209, 1–45 (1998)
Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. The Computer Journal 51(3), 255–269 (2008)
Bourgeois, N., Della Croce, F., Escoffier, B., Paschos, V.T.: Exact algorithms for dominating clique problems. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 4–13. Springer, Heidelberg (2009)
Fomin, F.V., Gaspers, S., Pyatkin, A.V.: Finding a minimum feedback vertex set in time \(\mathcal{O}(1.7548^n)\). In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 184–191. Springer, Heidelberg (2009)
Fomin, F.V., Gaspers, S., Saurabh, S., Stepanov, A.A.: On two techniques of combining branching and treewidth. Algorithmica 54, 181–207 (2009)
Fomin, F.V., Grandoni, F., Pyatkin, A., Stepanov, A.A.: Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications. ACM Transactions on Algorithms 5, 9 (2008)
Fomin, F.V., Grandoni, F., Kratsch, D.: Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the EATCS 87, 47–77 (2005)
Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. Journal of the ACM 56, 25 (2009)
Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
Grandoni, F.: A note on the complexity of minimum dominating set. Journal of Discrete Algorithms 4, 209–214 (2006)
Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of the SIAM 10, 196–210 (1962)
Iwama, K.: Worst-case upper bounds for k-sat. Bulletin of the EATCS 82, 61–71 (2004)
Karp, R.M.: Dynamic programming meets the principle of inclusion-exclusion. Operations Research Letters 1, 49–51 (1982)
Kratsch, D., Liedloff, M.: An exact algorithm for the minimum dominating clique problem. Theoretical Computer Science 385, 226–240 (2007)
Riege, T., Rothe, J.: An exact 2.9416n algorithm for the three domatic number problem. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 733–744. Springer, Heidelberg (2005)
Riege, T., Rothe, J., Spakowski, H., Yamamoto, M.: An improved exact algorithm for the domatic number problem. Information Processing Letters 101, 101–106 (2007)
Schöning, U.: Algorithmics in exponential time. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 36–43. Springer, Heidelberg (2006)
Tarjan, R.E.: Finding a maximum clique. Technical report, Department of Computer Science, Cornell University, Ithaca, NY (1972)
Tarjan, R.E., Trojanowski, A.: Finding a maximum independent set. SIAM Journal on Computing 6, 537–546 (1977)
van Rooij, J.M.M., Bodlaender, H.L.: Design by measure and conquer: a faster exact algorithm for dominating set. In: Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2008. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Leibniz International Proceedings in Infomatics, vol. 1, pp. 657–668 (2008)
van Rooij, J.M.M., Nederlof, J., van Dijk, T.C.: Inclusion/exclusion meets measure and conquer: exact algorithms for counting dominating sets. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 554–565. Springer, Heidelberg (2009)
Woeginger, G.J.: Exact algorithms for NP-hard problems: A survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol. 2570, pp. 185–207. Springer, Heidelberg (2003)
Woeginger, G.J.: Space and time complexity of exact algorithms: some open problems. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 281–290. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Rooij, J.M.M. (2010). Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number. In: Calamoneri, T., Diaz, J. (eds) Algorithms and Complexity. CIAC 2010. Lecture Notes in Computer Science, vol 6078. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13073-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-13073-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13072-4
Online ISBN: 978-3-642-13073-1
eBook Packages: Computer ScienceComputer Science (R0)