Abstract
Many exact algorithms for \(\mathcal{NP}\)-hard graph problems adopt the old Davis-Putman branch-and-reduce paradigm. The performance of these algorithms often suffers from the increasing number of graph modifications, such as deletions, that reduce the problem instance and have to be “taken back” frequently during the search process. The use of efficient data structures is necessary for fast graph modification modules as well as fast take-back procedures. In this paper, we investigate practical implementation-based aspects of exact algorithms by providing a hybrid graph representation that addresses the take-back challenge and combines the advantage of \({\mathcal{O}}(1)\) adjacency-queries in adjacency-matrices with the advantage of efficient neighborhood traversal in adjacency-lists.
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
Chen, J., Kanj, I.A., Jia, W.: Vertex cover: Further observations and further improvements. Journal of Algorithms 41, 313–324 (2001)
Chen, J., Liu, L., Jia, W.: Improvement on vertex cover for low-degree graphs. Networks 35(4), 253–259 (2000)
Engebretsen, L., Holmerin, J.: Clique is hard to approximate within n 1 − o(1). In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 2–12. Springer, Heidelberg (2000)
Fomin, F.V., Grandoni, F., Kratsch, 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., Grandoni, F., Kratsch, D.: Solving connected dominating set faster than 2n. Algorithmica 52(2), 153–166 (2008)
Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: a simple O(20.288n) independent set algorithm. In: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (SODA), New York, USA, pp. 18–25 (2006)
Fomin, F.V., Kratsch, D., Woeginger, L., 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)
Grandoni, F.: A note on the complexity of minimum dominating set. J. Discrete Algorithms 4(2), 209–214 (2006)
Hastad, J.: Clique is hard to approximate within n (1 − ε). Acta Mathematica, 627–636 (1996)
Randerath, B., Schiermeyer, I.: Exact algorithms for minimum dominating set. Technical report, Zentrum für Angewandte Informatik Köln, Lehrstuhl Speckenmeyer (2004)
van Rooij, J.M., Bodlaender, H.L.: Exact algorithms for edge domination. Technical Report UU-CS-2007-051, Department of Information and Computing Sciences, Utrecht University (2007)
van Rooij, J.M., Nederlof, J., van Dijk, T.C.: Inclusion/exclusion meets measure and conquer: Exact algorithms for counting dominating sets. Technical Report UU-CS-2008-043, Department of Information and Computing Sciences, Utrecht University (2008)
van Rooij, J.M., Bodlaender, H.L.: Design by measure and conquer, a faster exact algorithm for dominating set. In: Albers, S., Weil, P. (eds.) STACS. LIPIcs, vol. 1, pp. 657–668. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2008)
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
Abu-Khzam, F.N., Langston, M.A., Mouawad, A.E., Nolan, C.P. (2010). A Hybrid Graph Representation for Recursive Backtracking Algorithms. In: Lee, DT., Chen, D.Z., Ying, S. (eds) Frontiers in Algorithmics. FAW 2010. Lecture Notes in Computer Science, vol 6213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14553-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-14553-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14552-0
Online ISBN: 978-3-642-14553-7
eBook Packages: Computer ScienceComputer Science (R0)