In this work, we present the first linear time deterministic algorithm computing the 4-edge-connected components of an undirected graph. First, we show an algorithm listing all 3-edge-cuts in a given 3-edge-connected graph, and then we use the output of this algorithm in order to determine the 4-edge-connected components of the graph.
翻译:在这项工作中,我们展示了第一个线性时间确定算法,计算一个无方向图的四端连接元件。首先,我们展示了一种算法,将所有三端切口都列在一个三端连接图中,然后我们用这个算法的输出来确定图表的四端连接元件。