DeepAI AI Chat

A Constraint Model for the Tree Decomposition of a Graph

08/07/2019

∙

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.

Benjamin Bumpus
1 publication
Patrick Prosser
5 publications
James Trimble
5 publications

page 1

page 2

page 3

page 4

∙ 12/02/2017

Non-branching tree-decompositions

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

0 Thanh N. Dang, et al. ∙

∙ 06/20/2021

TD-GEN: Graph Generation With Tree Decomposition

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

0 Hamed Shirzad, et al. ∙

∙ 09/02/2019

Computation Protein Design instances with small tree-width: selection based on coarse approximated 3D average position volume

This paper proposes small tree-width graph decomposition computational p...

0 David Allouche, et al. ∙

∙ 04/26/2022

Function Decomposition Tree with Causality-First Perspective and Systematic Description of Problems in Materials Informatics

As interdisciplinary science is flourishing because of materials informa...

0 Hiori Kino, et al. ∙

∙ 11/09/2021

Modular Decomposition of Hierarchical Finite State Machines

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

0 Oliver Biggar, et al. ∙

∙ 03/19/2021

Tri-Partitions and Bases of an Ordered Complex

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

0 Herbert Edelsbrunner, et al. ∙

∙ 06/04/2013

First-Order Decomposition Trees

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

0 Nima Taghipour, et al. ∙