List of Treewidth solvers, instances, and tools
A Rust library and CLI for computing optimal and heuristic tree decompositions
Greatest Of All Tree Decompositions: tree decompositions of graphs — elimination orders, FlowCutter, multilevel bisection — with PACE .gr/.td I/O and a command-line solver.
Students Project at LUH Hannover, Germany
An implemetation for computing the Shapley value (in polynomial time) of matching games over bounded treewidth graphs.
Project code developed to accompany the thesis of the bachelor programme BSc Data Science and Artificial Intelligence taught @ Universiteit Maastricht. It consists in (re-)discovering Forbidden Minors for Treewidth, through a series of graph search/analysis techniques.
LaTeX source for my presentation of Hans Bodlaender's "Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth"
Reproducible theory and experiments on representation alignment, trainability, and exact q-sample preparation in commuting quantum Boltzmann machines.
Minimum edges of a graph of treewidth k: cliques are optimal for k ≤ 7, then 34, 42, 47 and 53 for k = 8–11.
A tool that solves a variation of the SwitchSelection problem for MV distribution grids. This repository accompanies our contribution to PSCC 2024.
Estudio empírico de IA en matemáticas formales: ChordWidth, evidencia computacional y Lean. No es una resolución de P vs NP.
To associate your repository with the treewidth topic, visit your repo's landing page and select "manage topics."