Systematic design of an algorithm for biconnected components

Madhukara, K and Kumara, Pavan D and Rangana, Pandu C and Sundarb, R (1995) Systematic design of an algorithm for biconnected components. In: Science of Computer Programming, 25 (1). pp. 63-77.

PDF aaa.pdf Restricted to Registered users only Download (830kB) | Request a copy

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.

Item Type:	Journal Article
Publication:	Science of Computer Programming
Publisher:	Elsevier B.V.
Additional Information:	Copyright belongs to Elsevier B.V.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	18 Jun 2008
Last Modified:	19 Sep 2010 04:46
URI:	http://eprints.iisc.ac.in/id/eprint/14381

Actions (login required)

View Item