home / upper bounds / lower bounds / preprocessing / exact methods
An interactive platform for computing Treewidth of graphs
Welcome
Welcome to ComputeTW, an interactive platform for computing Treewidth of graphs. Soon, you will be able to compute upper or lower bounds on the treewidth of (small) graphs via this interface. For now, please bookmark this website and come back soon.
How it works
To use this service, you have to encode your graph in the so-called DIMACS graph coloring format. You can upload such a file to our server and apply an algorithm to compute an upper or lower bound on the treewidth of this graph.
To avoid overload of the server, only small graphs are accepted (the maximum size depends on the algorithm). For larger graphs, please contact me directly.
Links
- TreewidthLIB A benchmark for algorithms for Treewidth and related graph problems, by Hans Bodlaender
- Our papers Treewidth Computations I. Upper bounds and Treewidth Computations II. Lower bounds survey the upper and lower bounds available for treewidth.
Contact
Developed by Arie Koster
letzte Änderung: 08.11.2013 - 15:56
math2.rwth-aachen.de