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.

翻译：我们提出了一个更好的算法,用于在线性时间计算一个无方向图形的四美元直线连接元件。 新的算法只使用基本数据结构,在指针机计算模型中描述和实施很简单。