DeepAI AI Chat
Log In Sign Up

A Constraint Model for the Tree Decomposition of a Graph

by   Benjamin Bumpus, et al.
University of Glasgow

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 decomposition and the maximum cardinality of each node in that decomposition. Via a sequence of decision problems, the model allows us to find the tree width of a graph whilst delivering a tree decomposition of that width, i.e. a witness.


page 1

page 2

page 3

page 4


Non-branching tree-decompositions

We prove that if a graph has a tree-decomposition of width at most w, th...

TD-GEN: Graph Generation With Tree Decomposition

We propose TD-GEN, a graph generation framework based on tree decomposit...

Modular Decomposition of Hierarchical Finite State Machines

In this paper we develop an analogue of the graph-theoretic `modular dec...

Tri-Partitions and Bases of an Ordered Complex

Generalizing the decomposition of a connected planar graph into a tree a...

First-Order Decomposition Trees

Lifting attempts to speed up probabilistic inference by exploiting symme...