This question is not about any particular algorithm to look for articulation vertices (cut vertices) in a graph but rather seeking real world applications of algorithms involving such vertices.
I am going through Skienna's The Algorithm Design Manual and it gives an example of an articulation vertex in a telephone network as an approachable example.
Personally, I think there may be applications in networking where multipathing is implemented using more than one switches between the same set of connected hosts to provide tolerance against failure of one of the switches. But still, an algorithm to look for an articulation vertex is not directly applicable in this scenario.
Are there any real world examples of articulation vertices and how looking for them helps solving problems arising due to such vertices ?
Just adding a bit more food for thought. I think simulation based applications or maybe gaming could have some applications ?
For e.g. a game engine may generate some graph based entities on the fly, let's say a building which a player must go into in a FPS game. For testing the the on the fly part, it may be useful to look for parameters which may generate buildings(graphs) which are biconnected (or higher connected) for easy or easier settings where as graphs with articulation vertex can be considered to be hard settings. (Easy or hard here are relative terms and the semantics may be even reversed depending on the outcome of players' entering the graph)