SYSTEMATIC DESIGN OF AN ALGORITHM FOR BICONNECTED COMPONENTS

Authors
MADHUKAR K KUMAR DP RANGAN CP SUNDAR R
Citation
K. Madhukar et al., SYSTEMATIC DESIGN OF AN ALGORITHM FOR BICONNECTED COMPONENTS, Science of computer programming, 25(1), 1995, pp. 63-77
Citations number
4
Categorie Soggetti
Computer Sciences","Computer Science Software Graphycs Programming
Journal title
Science of computer programming → ACNP
ISSN journal
01676423
Volume
25
Issue
1
Year of publication
1995
Pages
63 - 77
Database
ISI
SICI code
0167-6423(1995)25:1<63:SDOAAF>2.0.ZU;2-6
Abstract
In this paper we present a new linear algorithm for finding the biconn ected components of an undirected simple graph. The presentation of th is algorithm is done as an exercise in the use of modem principles and techniques for systematic development of algorithms.