Explore relationships

Branch-decomposition

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

Use + to expand a branch. Click a topic name to open its summary.