ComputeTW - Exact methods

Currently, one exact method is available for experiments.

Dynamic Programming (DP) as described in On exact algorithms for treewidth (H. L. Bodlaender, F. V. Fomin, A. M. C. A. Koster, D. Kratsch, D. M. Thilikos) In Proceedings 14th Annual European Symposium on Algorithms, ESA 2006, Springer (Y. Azar, T. Erlebach, eds.) volume 4168 (2006), 672--683.

More algorithms might follow.

letzte Änderung: 08.11.2013 - 15:00