Title of article
Systematic design of an algorithm for biconnected components
Author/Authors
K. Madhukar، نويسنده , , D.Pavan Kumar، نويسنده , , C. Pandu Rangan، نويسنده , , R. Sundar، نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 1995
Pages
15
From page
63
To page
77
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.
Journal title
Science of Computer Programming
Serial Year
1995
Journal title
Science of Computer Programming
Record number
1079421
Link To Document