Abstract
In this paper, we consider the Minimum Independent Dominating Set problem and develop exact exponential algorithms that break the trivial O(2|V |) bound. A simple \(O^{*}({\sqrt{3}}^{|V|})\) time algorithm is developed to solve this problem on general graphs. For sparse graphs, e.g. graphs with degree bounded by 3 and 4, we show that a few new branching techniques can be applied to these graphs and the resulting algorithms have time complexities O *(20.465|V |) and O *(20.620|V |), respectively. All our algorithms only need polynomial space.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proceedings of SODA 1999, pp. 856–857 (1999)
Chen, J., Kanj, I.A., Jia, W.: Vertex Cover: Further Observations and Further Improvements. Journal of Algorithms 41, 280–301 (2001)
Eppstein, D.: Quasiconvex analysis of backtracking algorithms. In: Proceedings of SODA 2004, pp. 788–797 (2004)
Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and Conquer: A Simple O(20.288 n) Independent Set Algorithm. In: Proceedings of SODA 2006 (to appear, 2006)
Fomin, F.V., Hoie, K.: Pathwidth of cubic graphs and exact algorithms. Information Processing Letters 97(5), 191–196 (2006)
Fomin, F.V., Grandoni, F., Krastch, D.: Measure and conquer: domination - a case study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 191–203. Springer, Heidelberg (2005)
Fomin, F.V., Kratsch, D., Woeginger, G.J.: Exact(exponential) algorithms for the dominating set problem. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 245–256. Springer, Heidelberg (2004)
Garey, M.R., Johnson, D.S.: Computers and intractability, A guide to the theory of NP-completeness. Freeman and Company, New York (1979)
Grandoni, F.: A note on the complexity of minimum dominating set. Journal of Discrete Algorithms (in press)
Halldórsson, M.M.: Approximating the minimum maximal independence number. Information Processing Letter 46, 169–172 (1993)
Kann, V.: On the approximability of NP-complete optimization problems, Ph.D. Thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm (1992)
Kneis, J., Mölle, D., Richter, S., Rossmanith, P.: Algorithms based on the treewidth of sparse graphs. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 385–396. Springer, Heidelberg (2005)
Kuhn, F., Nieberg, T., Moscibroda, T., Wattenhofer, R.: Local approximation schemes for ad hoc and sensor networks. In: 2005 Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 97–103 (2005)
Randerath, B., Schiermeyer, I.: Exact algorithms for MINIMUM DOMINATING SET, Technical Report zaik-469, Zentrum für Angewandte Informatik Köln, Germany (2004)
Reed, B.: Paths, stars and the number three. Combinatorial Probabilistic Computing 5, 277–295 (1996)
Robson, J.M.: Finding a maximum independent set in time O(2n/4), Technical Report 1251-01, LABRI, Université Bordeaux I (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, C., Song, Y. (2006). Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs. In: Asano, T. (eds) Algorithms and Computation. ISAAC 2006. Lecture Notes in Computer Science, vol 4288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11940128_45
Download citation
DOI: https://doi.org/10.1007/11940128_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49694-6
Online ISBN: 978-3-540-49696-0
eBook Packages: Computer ScienceComputer Science (R0)