Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Computing Articulation Points Using Maximal Clique-Based Vertex Classification
The bridge vertices of an unweighted undirected graph are those vertices whose removal increases the number of connected components of the graph, i.e., the vertices whose removal disconnects the graph. However...