Idioma:

On exact algorithms for treewidth

Bodlaender, H.L ; Fomin, F.V ; Koster, A.M.C.A ; Kratsch, D ; Thilikos, D.M

Texto completo disponível

Citações Citado por

Título:
On exact algorithms for treewidth
Autor: Bodlaender, H.L ; Fomin, F.V ; Koster, A.M.C.A ; Kratsch, D ; Thilikos, D.M
Assuntos: Wiskunde en Informatica
Notas: 0924-3275
https://dspace.library.uu.nl/handle/1874/22183
UU-CS 2006-032, - (2006)
Descrição: 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*(2n). 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.(4n) algorithm that requires polynomial space. We also show that with a more complicated algorithm, using balanced separators, Treewidth can be computed in O*(2.9512n) time and polynomial space.
Data de criação/publicação: 2006
Idioma: Inglês

Links

Voltar para lista de resultados