Jdrasil: a modular library for computing tree decompositions

DOI10.4230/LIPICS.SEA.2017.28zbMATH Open1433.68275OpenAlexW2750561661MaRDI QIDQ4580187FDOQ4580187

Authors: Max Bannach, Sebastian Berndt, Thorsten Ehlers 

Publication date: 13 August 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.SEA.2017.28

Recommendations

• Computing tree width: from theory to practice and back
• Treewidth computations. I: Upper bounds
• \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
• Practical access to dynamic programming on tree decompositions
• Faster computation of path-width

zbMATH Keywords

tree widthexperimental evaluationalgorithmic library

Mathematics Subject Classification ID

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)

Cited In (9)

• Practical access to dynamic programming on tree decompositions
• Title not available (Why is that?)
• On integer linear programs for treewidth based on perfect elimination orderings
• Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth
• Practical Access to Dynamic Programming on Tree Decompositions
• Jdrasil
• Title not available (Why is that?)
• Computing optimal hypertree decompositions with SAT
• Decoding tree decompositions from permutations

Uses Software

• CPLEX
• Plingeling
• BZTreewidth

This page was built for publication: Jdrasil: a modular library for computing tree decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580187)