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 条
  • [21] Maintaining bridge-connected and biconnected components on-line
    Westbrook, Jeffery
    Tarjan, Robert E.
    Algorithmica (New York), 1992, 7 (5-6): : 433 - 464
  • [22] Sub-linear distributed algorithms for sparse certificates and biconnected components
    Thurimella, R
    JOURNAL OF ALGORITHMS, 1997, 23 (01) : 160 - 179
  • [23] On the parallel computation of the biconnected and strongly connected co-components of graphs
    Nikolopoulos, Stavros D.
    Palios, Leonidas
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (14) : 1858 - 1877
  • [24] Smashing peacocks further: Drawing quasi-trees from biconnected components
    Archambault, Daniel
    Munzner, Tamara
    Auber, David
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2006, 12 (05) : 813 - 820
  • [25] A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem
    Manku, GS
    INFORMATION PROCESSING LETTERS, 1996, 59 (01) : 1 - 7
  • [26] An efficient distributed algorithm for centering a spanning tree of a biconnected graph
    Aranha, RFM
    Rangan, CP
    INFORMATION PROCESSING LETTERS, 1996, 59 (03) : 145 - 150
  • [27] A FAST AND SIMPLE ALGORITHM FOR THE BOTTLENECK BICONNECTED SPANNING SUBGRAPH PROBLEM
    PUNNEN, AP
    NAIR, KPK
    INFORMATION PROCESSING LETTERS, 1994, 50 (05) : 283 - 286
  • [28] Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components (Extended Abstract)
    Vietz, Duygu
    Hoffmann, Stefan
    Wanke, Egon
    WALCOM: ALGORITHMS AND COMPUTATION (WALCOM 2019), 2019, 11355 : 175 - 187
  • [29] Design and Implementation of the Components of the Symmetric Cryptographic Algorithm
    Ci, Yunfei
    Shi, Guozhen
    Yang, Feng
    Diao, Jiawen
    Liu, Cuijie
    Mao, Weihua
    2017 IEEE SECOND INTERNATIONAL CONFERENCE ON DATA SCIENCE IN CYBERSPACE (DSC), 2017, : 483 - 487
  • [30] Measuring Topological Robustness of Scale-Free Networks Using Biconnected Components
    Sayeed, Suri Dipannita
    Hasan, Md Sajid
    Rahman, Md Saidur
    2015 INTERNATIONAL CONFERENCE ON NETWORKING SYSTEMS AND SECURITY (NSYSS), 2015, : 18 - 23
12345