Improved Linear-Time Algorithm for Computing the $4$-Edge-Connected Components of a Graph

Abstract

We present an improved algorithm for computing the $4$-edge-connected components of an undirected graph in linear time. The new algorithm uses only elementary data structures, and it is simple to describe and to implement in the pointer machine model of computation.

arXiv admin note: substantial text overlap with arXiv:2105.02910