Althaus, Ernst
[VerfasserIn];
Schnurbusch, Daniela
[VerfasserIn];
Wüschner, Julian
[VerfasserIn];
Ziegler, Sarah
[VerfasserIn]
;
Ernst Althaus and Daniela Schnurbusch and Julian Wüschner and Sarah Ziegler
[MitwirkendeR]
Anmerkungen:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Beschreibung:
We revisit the exact algorithm to compute the treewidth of a graph of Tamaki and present it in a way that facilitates improvements. The so-called I-blocks and O-blocks enumerated by the algorithm are interpreted as subtrees of a tree-decomposition that is constructed. This simplifies the proof of correctness and allows to discard subtrees from the enumeration by some simple observations. In our experiments, we show that one of these modifications in particular reduces the number of enumerated objects considerably.