Skip to main content
SpringerLink
Log in

A Simple 3-Edge-Connected Component Algorithm

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. School of Computer Science, University of Windsor, Windsor, Ontario, N9B 3P4 , Canada

    Yung H. Tsin

Authors
  1. Yung H. Tsin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yung H. Tsin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tsin, Y. A Simple 3-Edge-Connected Component Algorithm. Theory Comput Syst 40, 125–142 (2007). https://doi.org/10.1007/s00224-005-1269-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-005-1269-4

Keywords

Search

Navigation