BCCs and 2CCs

2-Edge-Connected Components

(implementation)

With DSU

The analysis for the above problem mentions an $\mathcal{O}(m\alpha(n))$ solution. Although this is not a two-connected component problem, we can in fact use DSU to generate two-connected components.

(explanation?)

Problems

• SRM 787 1000

Biconnected Components

note that BCCs contain EDGES not VERTICES

Related topics include

• Articulation Points
• Bridges
• Block-Cut Tree

Tutorial

(implementation)

Problems