2026-08-02T15:39:12Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7605 2024-03-06T10:39:50Z ddc:004 open_access

Jdrasil: A Modular Library for Computing Tree Decompositions Bannach, Max Berndt, Sebastian Ehlers, Thorsten tree width algorithmic library experimental evaluation While the theoretical aspects concerning the computation of tree width - one of the most important graph parameters - are well understood, it is not clear how it can be computed practically. We present the open source Java library Jdrasil that implements several different state of the art algorithms for this task. By experimentally comparing these algorithms, we show that the default choices made in Jdrasil lead to an competitive implementation (it took the third place in the first PACE challenge) while also being easy to use and easy to extend. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Max Bannach and Sebastian Berndt and Thorsten Ehlers 2017 Is Part Of LIPIcs, Volume 75, 16th International Symposium on Experimental Algorithms (SEA 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SEA.2017.28 urn:nbn:de:0030-drops-76051 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2017.28 eng https://creativecommons.org/licenses/by/3.0/legalcode