# Computing the 4-Edge-Connected Components of a Graph in Linear Time

We present the first linear-time algorithm that computes the 4-edge-connected components of an undirected graph. Hence, we also obtain the first linear-time algorithm for testing 4-edge connectivity. Our results are based on a linear-time algorithm that computes the 3-edge cuts of a 3-edge-connected graph G, and a linear-time procedure that, given the collection of all 3-edge cuts, partitions the vertices of G into the 4-edge-connected components.

## Authors

• 5 publications
• 10 publications
• 3 publications
• ### Determining 4-edge-connected components in linear time

In this work, we present the first linear time deterministic algorithm c...
05/04/2021 ∙ by Wojciech Nadara, et al. ∙ 0

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

We present an improved algorithm for computing the 4-edge-connected comp...
08/19/2021 ∙ by Loukas Georgiadis, et al. ∙ 0

• ### Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems

A directed graph G=(V,E) is twinless strongly connected if it contains a...
07/08/2020 ∙ by Loukas Georgiadis, et al. ∙ 0

• ### Making Bidirected Graphs Strongly Connected

We consider problems to make a given bidirected graph strongly connected...
09/04/2017 ∙ by Tatsuya Matsuoka, et al. ∙ 0

• ### Disjoint Stable Matchings in Linear Time

We show that given a SM instance G as input we can find a largest collec...
11/26/2020 ∙ by Prajakta Nimbhorkar, et al. ∙ 0

• ### A linear time algorithm for constructing orthogonal floor plans with minimum number of bends

Let G = (V, E) be a planar triangulated graph (PTG) having every face tr...
06/25/2020 ∙ by Pinki, et al. ∙ 0

• ### Edge Disjoint Spanning Trees in an Undirected Graph with E=2(V-1)

Given a connected undirected graph G = [V; E] where |E| =2(|V| -1), we p...
08/15/2018 ∙ by Hemant Malik, et al. ∙ 0

##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.