home / upper bounds / lower bounds / preprocessing / exact methods

ComputeTW - Lower bounds

Currently, one lower bound is available for experiments.

More algorithms are to follow.

For more information on the algorithms, we refer to our paper Contraction and Treewidth Lower Bounds, Journal of Graph Algorithms and Applications, 10:1 (2006), pp. 5-49 (Authors: H.L. Bodlaender, T. Wolle, A.M.C.A. Koster).

last modified: 08/11/2013 - 15:00