Yet another optimal algorithm for 3-edge-connectivity

  • Tsin Y
  • 5


    Mendeley users who have this article in their library.
  • 16


    Citations of this article.


An optimal algorithm for 3-edge-connectivity is presented. The algorithm performs only one pass over the given graph to determine a set of cut-pairs whose removal leads to the 3-edge-connected components. An additional pass determines all the 3-edge-connected components of the given graph. The algorithm is simple, easy to implement and runs in linear time and space. Experimental results show that it outperforms all the previously known linear-time algorithms for 3-edge-connectivity in determining if a given graph is 3-edge-connected and in determining cut-pairs. Its performance is also among the best in determining the 3-edge-connected components. © 2008 Elsevier Inc. All rights reserved.

Author-supplied keywords

  • 3-edge-connected component
  • 3-edge-connected graph
  • Analysis of algorithms
  • Cut-pair
  • Depth-first search
  • Edge-connectivity
  • Graph connectivity

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Yung H. Tsin

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free