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 条
  • [31] A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
    Hu, Bin
    Raidl, Guenther R.
    HIS 2009: 2009 NINTH INTERNATIONAL CONFERENCE ON HYBRID INTELLIGENT SYSTEMS, VOL 3, PROCEEDINGS, 2009, : 63 - 68
  • [32] Path-based depth-first search for strong and biconnected components
    Gabow, HN
    INFORMATION PROCESSING LETTERS, 2000, 74 (3-4) : 107 - 114
  • [33] Optimal parallel algorithm for finding st-ambitus of a planar biconnected graph
    Algorithmica (New York), 3 (242):
  • [34] Photonics components design optimization using genetic algorithm
    Zayani, Hafedh M.
    Bahloul, Faouzi M.
    Saidani, Taoufik S.
    OPTICAL ENGINEERING, 2020, 59 (05)
  • [35] Optimal design of mechanical components using the Bees Algorithm
    Pham, D. T.
    Ghanbarzadeh, A.
    Otri, S.
    Koc, E.
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART C-JOURNAL OF MECHANICAL ENGINEERING SCIENCE, 2009, 223 (05) : 1051 - 1056
  • [36] Algorithm for Choosing the Study Design in Systematic Reviews
    Peinemann, F.
    Kleijnen, J.
    KLINISCHE PADIATRIE, 2016, 228 (05): : 235 - 239
  • [37] Algorithm for Choosing the Study Design in Systematic Reviews
    Peinemann, F.
    Kleijnen, J.
    PHYSIKALISCHE MEDIZIN REHABILITATIONSMEDIZIN KURORTMEDIZIN, 2016, 26 (06) : 279 - 283
  • [38] Using Biconnected Components for Efficient Identification of Upstream Features in Large Spatial Networks (GIS Cup)
    Goldthorpe, Zach
    Cannon, Jason
    Farebrother, Jesse
    Friggstad, Zachary
    Nascimento, Mario A.
    26TH ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS (ACM SIGSPATIAL GIS 2018), 2018, : 630 - 633
  • [39] A new algorithm for generating biconnected spanning subgraphs for topological optimization of data networks
    Belotserkovskii, DL
    Vishnevskii, VM
    AUTOMATION AND REMOTE CONTROL, 1997, 58 (01) : 88 - 97
  • [40] Optimal parallel algorithm for finding st-ambitus of a planar biconnected graph
    Easwarakumar, KS
    Krishnan, SV
    Rangan, CP
    Seshadri, S
    ALGORITHMICA, 1996, 15 (03) : 242 - 255
12345