Systematic design of an algorithm for biconnected components

In this paper we present a new linear algorithm for finding the biconnected components of an undirected simple graph. The presentation of this algorithm is done as an exercise in the use of modern principles and techniques for systematic development of algorithms.