On Exact Algorithms for Treewidth
We give experimental and theoretical results on the problem of computing the treewidth of a graph by exact exponential time algorithms using exponential space or using only polynomial space. We first report on an implementation of a dynamic programming algorithm for computing the treewidth of a graph with running time O ∗ (2 n ). This algorithm is based on the old dynamic programming method introduced by Held and Karp for the Traveling Salesman problem. We use some optimizations that do not affect the worst case running time but improve on the running time on actual instances and can be seen to be practical for small instances. However, our experiments show that the space used by the algorithm is an important factor to what input sizes the algorithm is effective. For this purpose, we settle the problem of computing treewidth under the restriction that the space used is only polynomial. In this direction we give a simple O ∗ (4 n ) algorithm that requires polynomial space. We also prove that using more refined techniques with balanced separators, Treewidth can be computed in O ∗ (2.9512 n ) time and polynomial space.
KeywordsTravel Salesman Problem Exact Algorithm Dynamic Programming Algorithm Tree Decomposition Recursive Call
Unable to display preview. Download preview PDF.
- 12.Gogate, V., Dechter, R.: A complete anytime algorithm for treewidth. In: Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence UAI 2004, Arlington, Virginia, USA, pp. 201–208. AUAI Press (2004)Google Scholar
- 18.Shoikhet, K., Geiger, D.: A practical algorithm for finding optimal triangulations. In: Proc. National Conference on Artificial Intelligence (AAAI 1997), pp. 185–190. Morgan Kaufmann, San Francisco (1997)Google Scholar
- 19.Treewidthlib (2004), http://www.cs.uu.nl/people/hansb/treewidthlib