Graph theory objects | Graph minor theory | Trees (graph theory)
Tree decomposition
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. 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 decomposition was originally introduced by Rudolf Halin. Later it was rediscovered by Neil Robertson and Paul Seymour and has since been studied by many other authors. (Wikipedia).
