Tree decomposition

This article is about tree structure of graphs. For decomposition of graphs into trees, see Graph_theory#Decomposition_problems.

A graph with eight vertices, and a tree decomposition of it onto a tree with six nodes. Each graph edge connects two vertices that are listed together at some tree node, and each graph vertex is listed at the nodes of a contiguous subtree of the tree. Each tree node lists at most three vertices, so the width of this decomposition is two.

In graph theory, a tree decomposition is a mapping of a graph into a tree that can be used to define the treewidth of the graph and speed up solving certain computational problems on the graph.

In machine learning, tree decompositions are also called junction trees, clique trees, or join trees; they play an important role in problems like probabilistic inference, constraint satisfaction, query optimization, and matrix decomposition.

The concept of tree decompositions was originally introduced by Rudolf Halin (1976). Later it was rediscovered by Neil Robertson and Paul Seymour (1984) and has since been studied by many other authors.^[1]

Definition

Intuitively, a tree decomposition represents the vertices of a given graph G as subtrees of a tree, in such a way that vertices in the given graph are adjacent only when the corresponding subtrees intersect. Thus, G forms a subgraph of the intersection graph of the subtrees. The full intersection graph is a chordal graph.

Each subtree associates a graph vertex with a set of tree nodes. To define this formally, we represent each tree node as the set of vertices associated with it. Thus, given a graph G = (V, E), a tree decomposition is a pair (X, T), where X = {X₁, ..., X_n} is a family of subsets of V, and T is a tree whose nodes are the subsets X_i, satisfying the following properties:^[2]

The union of all sets X_i equals V. That is, each graph vertex is associated with at least one tree node.
For every edge (v, w) in the graph, there is a subset X_i that contains both v and w. That is, vertices are adjacent in the graph only when the corresponding subtrees have a node in common.
If X_i and X_j both contain a vertex v, then all nodes X_k of the tree in the (unique) path between X_i and X_j contain v as well. That is, the nodes associated with vertex v form a connected subset of T. This is also known as coherence, or the running intersection property. It can be stated equivalently that if $X_i$ , $X_j$ and $X_k$ are nodes, and $X_k$ is on the path from $X_i$ to $X_j$ , then $X_i \cap X_j \subseteq X_k$ .

The tree decomposition of a graph is far from unique; for example, a trivial tree decomposition contains all vertices of the graph in its single root node.

A tree decomposition in which the underlying tree is a path graph is called a path decomposition, and the width parameter derived from these special types of tree decompositions is known as pathwidth.

A tree decomposition (X, T = (I, F)) of treewidth k is smooth, if for all $i \in I : |X_i| = k + 1$ , and for all $(i, j) \in F : |X_i \cap X_j| = k$ .^[3]

Treewidth

Main article: Treewidth

The width of a tree decomposition is the size of its largest set X_i minus one. The treewidth tw(G) of a graph G is the minimum width among all possible tree decompositions of G. In this definition, the size of the largest set is diminished by one in order to make the treewidth of a tree equal to one. Treewidth may also be defined from other structures than tree decompositions, including chordal graphs, brambles, and havens.

It is NP-complete to determine whether a given graph G has treewidth at most a given variable k.^[4] However, when k is any fixed constant, the graphs with treewidth k can be recognized, and a width k tree decomposition constructed for them, in linear time.^[3] The time dependence of this algorithm on k is exponential.

Dynamic programming

At the beginning of the 1970s, it was observed that a large class of combinatorial optimization problems defined on graphs could be efficiently solved by non serial dynamic programming as long as the graph had a bounded dimension,^[5] a parameter related to treewidth. Later, several authors independently observed at the end of the 1980s^[6] that many algorithmic problems that are NP-complete for arbitrary graphs may be solved efficiently by dynamic programming for graphs of bounded treewidth, using the tree-decompositions of these graphs.

As an example, consider the problem of finding the maximum independent set in a graph of treewidth k. To solve this problem, first choose one of the nodes of the tree decomposition to be the root, arbitrarily. For a node X_i of the tree decomposition, let D_i be the union of the sets X_j descending from X_i. For an independent set S ⊂ X_i, let A(S,i) denote the size of the largest independent subset I of D_i such that I ∩ X_i = S. Similarly, for an adjacent pair of nodes X_i and X_j, with X_i farther from the root of the tree than X_j, and an independent set S ⊂ X_i ∩ X_j, let B(S,i,j) denote the size of the largest independent subset I of D_i such that I ∩ X_i ∩ X_j = S. We may calculate these A and B values by a bottom-up traversal of the tree:

A(S,i)=|S| + \sum_{j} \left(B(S\cap X_j, j,i) - |S\cap X_j|\right)

B(S,i,j)=\max_{S'\subset X_i\atop S=S'\cap X_j} A(S',i)

where the sum in the calculation of $A(S,i)$ is over the children of node $X_i$ .

At each node or edge, there are at most 2^k sets S for which we need to calculate these values, so if k is a constant then the whole calculation takes constant time per edge or node. The size of the maximum independent set is the largest value stored at the root node, and the maximum independent set itself can be found (as is standard in dynamic programming algorithms) by backtracking through these stored values starting from this largest value. Thus, in graphs of bounded treewidth, the maximum independent set problem may be solved in linear time. Similar algorithms apply to many other graph problems.

This dynamic programming approach is used in machine learning via the junction tree algorithm for belief propagation in graphs of bounded treewidth. It also plays a key role in algorithms for computing the treewidth and constructing tree decompositions: typically, such algorithms have a first step that approximates the treewidth, constructing a tree decomposition with this approximate width, and then a second step that performs dynamic programming in the approximate tree decomposition to compute the exact value of the treewidth.^[3]

Notes

↑ Diestel (2005) pp.354–355
↑ Diestel (2005) section 12.3
↑ 3.0 3.1 3.2 Bodlaender (1996).
↑ Arnborg, Corneil & Proskurowski (1987).
↑ Bertelé & Brioschi (1972).
↑ Arnborg & Proskurowski (1989); Bern, Lawler & Wong (1987); Bodlaender (1988).

References