List of Treewidth solvers, instances, and tools
A Rust library and CLI for computing optimal and heuristic tree decompositions
An implemetation for computing the Shapley value (in polynomial time) of matching games over bounded treewidth graphs.
Submission for the PACE challenge 2024 -- exact track. This solver exactly solves the AMDS (Augmented minimum dominating set) problem, which is a more generalised minimum dominating set problem.
Add a description, image, and links to the treewidth-implementations topic page so that developers can more easily learn about it.
To associate your repository with the treewidth-implementations topic, visit your repo's landing page and select "manage topics."