2 papers
math.CT2021
Treewidth via Spined Categories (extended abstract)
Zoltan A. Kocsis, Benjamin Merlin Bumpus
Treewidth is a well-known graph invariant with multiple interesting applications in combinatorics. On the practical side, many NP-complete problems are polynomial-time (sometimes e…
cs.DM2019
A Constraint Model for the Tree Decomposition of a Graph
Benjamin Bumpus, Patrick Prosser, James Trimble
We present a constraint model for the problem of producing a tree decomposition of a graph. The inputs to the model are a simple graph G, the number of nodes in the desired tree de…