Groups
Category
A bridge tree is built by contracting every 2-edge-connected component of an undirected graph into a single node, leaving only bridges as edges between nodes.
Centroid decomposition splits a tree around a special node (centroid) so that every remaining component has at most half the nodes.