On finding 2-cuts and 3-edge-connected components in parallel

TL;DR

This paper presents a linear-time algorithm that simultaneously finds 2-cuts and 3-edge-connected components in a graph using only one depth-first search, improving efficiency over previous multi-phase methods.

Contribution

It extends existing algorithms to compute 2-cuts and 3-edge-connected components together in a single pass, reducing complexity and runtime.

Findings

Achieves linear-time complexity for combined 2-cut and 3-edge-connected component detection.

Uses a single depth-first search to perform both tasks simultaneously.

Improves efficiency over previous multi-phase algorithms.

Abstract

Given a connected undirected multigraph G (a graph that may contain parallel edges), the algorithm of [19] finds the 3-edge-connected components of $G$ in linear time using an innovative graph contraction technique based on a depth-first search. In [21], it was shown that the algorithm can be extended to produce a Mader construction sequence for each 3-edge-connected component, a cactus representation of the 2-cuts (cut-pairs) of each 2-edge-connected component of $G$, and the 1-cuts (bridges) at the same time. In this paper, we further extend the algorithm of [19] to generate the 2-cuts and the 3-edge-connected components of $G$ simultaneously in linear time by performing only one depth-first search over the input graph. Previously known algorithms solve the two problems separately in multiple phases.