Jdrasil swMATH ID: 25570 Software Authors: Bannach, Max; Berndt, Sebastian; Ehlers, Thorsten Description: Jdrasil: a modular library for computing tree decompositions. 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. Homepage: https://github.com/maxbannach/Jdrasil Source Code: https://github.com/maxbannach/Jdrasil Keywords: tree width; algorithmic library; experimental evaluation Related Software: D-FLAT; ToTo; dynASP; GitHub; Regina; BZTreewidth; Plingeling; CPLEX Cited in: 5 Publications Standard Articles 1 Publication describing the Software, including 1 Publication in zbMATH Year Jdrasil: a modular library for computing tree decompositions. Zbl 1433.68275Bannach, Max; Berndt, Sebastian; Ehlers, Thorsten 2017 all top 5 Cited by 9 Authors 3 Bannach, Max 3 Berndt, Sebastian 1 Bonnet, Edouard 1 Dell, Holger 1 Ehlers, Thorsten 1 Komusiewicz, Christian 1 Sikora, Florian 1 Talmon, Nimrod 1 Weller, Mathias Cited in 1 Serial 1 Algorithms Cited in 2 Fields 5 Computer science (68-XX) 1 Operations research, mathematical programming (90-XX) Citations by Year