home / upper bounds / lower bounds / preprocessing / exact methods
ComputeTW - Upper bounds
Currently, three upper bounds are available for experiments.
- Greedy Fill-In (GFI)
- Greedy Fill-In + Triangulation Minimization (GFI+TM)
- Greedy Degree (GD)
More algorithms are to follow.
For more information on the algorithms, we refer to our paper Treewidth Computations I. Upper bounds which surveys the upper bounds available for treewidth.
letzte Änderung: 08.11.2013 - 15:56
math2.rwth-aachen.de