In graph theory, a **tree decomposition** is a mapping of a graph into a tree that can be used to speed up solving certain problems on the original graph. The **treewidth** measures the number of graph vertices mapped onto any tree node in an optimal tree decomposition. While it is NP-hard to determine the treewidth of a graph, many NP-hard combinatorial problems on graphs are solvable in polynomial time when restricted to graphs of bounded treewidth.

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 and treewidth was originally introduced by Halin (1976). Later it was rediscovered by Robertson & Seymour (1984) and has since been studied by many other authors.

Read more about Tree Decomposition: Definition, Treewidth, Graph Minors, Dynamic Programming, Treewidth of Cliques, Treewidth of Trees

### Famous quotes containing the word tree:

“I saw the spiders marching through the air,

Swimming from *tree* to *tree* that mildewed day

In latter August when the hay

Came creaking to the barn.”

—Robert Lowell (1917–1977)