This article is about tree structure of graphs. For decomposition of graphs into trees, see Graph theory § Decomposition problems. For decomposition of trees in nature, see Nurse log.
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.
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,[1] and matrix decomposition.
The concept of tree decomposition 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.[2]
^Gottlob et al. (2012).
^Diestel (2005) pp.354–355
and 19 Related for: Tree decomposition information
In graph theory, a treedecomposition 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...
equivalent ways: in terms of the size of the largest vertex set in a treedecomposition of the graph, in terms of the size of the largest clique in a chordal...
property that is held by all cards). decomposition See treedecomposition, path decomposition, or branch-decomposition. degenerate degeneracy A k-degenerate...
bucket splits. The tree directory follows the spatial decomposition of the quadtree. A tree-pyramid (T-pyramid) is a "complete" tree; every node of the...
structures underlying the SPQR tree, the triconnected components of a graph, and the connection between this decomposition and the planar embeddings of...
science which studies decomposition is generally referred to as taphonomy from the Greek word taphos, meaning tomb. Decomposition can also be a gradual...
path-decomposition is a treedecomposition (X,T) in which the underlying tree T of the decomposition is a path graph. The width of a path-decomposition is...
graph. That is, a branch-decomposition may be viewed as a hierarchical clustering of the edges of the graph. Branch-decompositions and an associated numerical...
forms a treedecomposition of the graph, with treewidth equal to one less than the size of the largest clique in the graph; the treedecomposition of any...
Decomposers are organisms that break down dead or decaying organisms; they carry out decomposition, a process possible by only certain kingdoms, such as...
tree Fault tree Free tree Game tree K-ary tree Octree Parse tree Phylogenetic tree Polytree Positional tree PQ tree R-tree Rooted tree Ordered tree Recursive...
separator hierarchy which may take the form of either a treedecomposition or a branch-decomposition of the graph. Separator hierarchies may be used to devise...
of decomposition techniques could be used in order to decrease the size of an equation set: decomposition-recombination planning algorithms, tree decomposition...
architecture of software systems. It is based on a structural decomposition (a hierarchical tree structure) of a system into containers and components and...
optimal subband tree structuring (SB-TS), also called wavelet packet decomposition (WPD; sometimes known as just wavelet packets or subband tree), is a wavelet...
In graph theory, the modular decomposition is a decomposition of a graph into subsets of vertices called modules. A module is a generalization of a connected...
the ear decomposition with the fewest even ears. A tree ear decomposition is a proper ear decomposition in which the first ear is a single edge and for each...
the treewidth of a circle graph can be determined, and an optimal treedecomposition constructed, in O(n3) time. Additionally, a minimum fill-in (that...
Global Information