A Simple 3-Edge-Connected Component Algorithm

被引：0
|
作者：
Yung H. Tsin
机构：
[1] School of Computer Science,
[2] University of Windsor,undefined
[3] Windsor,undefined
[4] Ontario,undefined
[5] N9B 3P4 ,undefined
来源：
Theory of Computing Systems | 2007年 / 40卷
关键词：
Connected Graph; Undirected Graph; Edge Incident; Recursive Call; Component Algorithm;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A simple linear-time algorithm for finding all the 3-edge-connected components of an undirected graph is presented. The algorithm performs only one depth-first search over the given graph. Previously best known algorithms perform multiple depth-first searches in multiple phases.
引用
收藏
页码：125 / 142
页数：17
相关论文
共 50 条
  • [1] A simple 3-edge-connected component algorithm
    Tsin, Yung H.
    THEORY OF COMPUTING SYSTEMS, 2007, 40 (02) : 125 - 142
  • [2] A simple 3-edge connected component algorithm revisited
    Norouzi, Nima
    Tsin, Yung H.
    INFORMATION PROCESSING LETTERS, 2014, 114 (1-2) : 50 - 55
  • [3] On 3-Edge-Connected Supereulerian Graphs
    Lai, Hong-Jian
    Li, Hao
    Shao, Yehong
    Zhan, Mingquan
    GRAPHS AND COMBINATORICS, 2011, 27 (02) : 207 - 214
  • [4] On 3-Edge-Connected Supereulerian Graphs
    Hong-Jian Lai
    Hao Li
    Yehong Shao
    Mingquan Zhan
    Graphs and Combinatorics, 2011, 27 : 207 - 214
  • [5] A Note on the 3-Edge-Connected Supereulerian Graphs
    Xiao Min LIDeng Xin LI School of Mathematics and StatisticsChongqing Technology and Business UniversityChongqing PRChina
    数学研究与评论, 2010, 30 (05) : 944 - 946
  • [6] Connectivity of orientations of 3-edge-connected graphs
    Horsch, Florian
    Szigeti, Zoltan
    EUROPEAN JOURNAL OF COMBINATORICS, 2021, 94
  • [7] Flows in 3-edge-connected bidirected graphs
    Wei, Erling
    Tang, Wenliang
    Wang, Xiaofeng
    FRONTIERS OF MATHEMATICS IN CHINA, 2011, 6 (02) : 339 - 348
  • [8] Flows in 3-edge-connected bidirected graphs
    Erling Wei
    Wenliang Tang
    Xiaofeng Wang
    Frontiers of Mathematics in China, 2011, 6 : 339 - 348
  • [9] A Note on the 3-Edge-Connected Supereulerian Graphs
    Xiao Min LI
    Journal of Mathematical Research with Applications, 2010, 30 (05) : 944 - 946
  • [10] Group Connectivity in 3-Edge-Connected Graphs
    Yang, Fan
    Li, Xiangwen
    GRAPHS AND COMBINATORICS, 2012, 28 (05) : 743 - 750
12345