Why should biconnected components be identified first
Most optimization algorithms for combinatorial problems on graphs assume that the graph is connected. The paper describes a decomposition procedure that reduces the solution for some problems solving them only on the biconnected components of the graph.
scientific article; zbMATH DE number 221653