Systematic design of an algorithm for biconnected components

Date Issued
01-01-1995
Author(s)
Madhukar, K.
Kumar, D. Pavan
Rangan, C. Pandu
Sundar, R.
DOI
Abstract
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. © 1995.
Volume
25