# Category:Tree decomposition

In graph theory, a **branch-decomposition** of an undirected graph G is a hierarchical clustering of the edges of G, represented by an unrooted binary tree T with the edges of G as its leaves

## Media in category "Tree decomposition"

The following 6 files are in this category, out of 6 total.

- Inference.png 33 KB