Jdrasil: A Modular Library for Computing Tree Decompositions
From MaRDI portal
Publication:4580187
DOI10.4230/LIPIcs.SEA.2017.28zbMath1433.68275OpenAlexW2750561661MaRDI QIDQ4580187
Max Bannach, Thorsten Ehlers, Sebastian Berndt
Publication date: 13 August 2018
Full work available at URL: https://doi.org/10.4230/LIPIcs.SEA.2017.28
Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to computer science (68-04)
Related Items (8)
Computing optimal hypertree decompositions with SAT ⋮ Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth ⋮ On integer linear programs for treewidth based on perfect elimination orderings ⋮ Unnamed Item ⋮ Practical Access to Dynamic Programming on Tree Decompositions ⋮ Practical access to dynamic programming on tree decompositions ⋮ Unnamed Item ⋮ Jdrasil
Uses Software
This page was built for publication: Jdrasil: A Modular Library for Computing Tree Decompositions
