SYSTEMATIC DESIGN OF AN ALGORITHM FOR BICONNECTED COMPONENTS

被引：2
|
作者：
MADHUKAR, K
KUMAR, DP
RANGAN, CP
SUNDAR, R
机构：
[1] INDIAN INST TECHNOL,DEPT COMP SCI & ENGN,MADRAS 600036,TAMIL NADU,INDIA
[2] INDIAN INST SCI,DEPT COMP SCI & AUTOMAT,BANGALORE 560012,KARNATAKA,INDIA
来源：
SCIENCE OF COMPUTER PROGRAMMING | 1995年 / 25卷 / 01期
关键词：
D O I：
10.1016/0167-6423(95)00005-D
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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 modem principles and techniques for systematic development of algorithms.
引用
收藏
页码：63 / 77
页数：15
相关论文
共 50 条
12345