Computing the $4$-Edge-Connected Components of a Graph in Linear Time
Data Structures and Algorithms
2021-05-10 v1
Abstract
We present the first linear-time algorithm that computes the -edge-connected components of an undirected graph. Hence, we also obtain the first linear-time algorithm for testing -edge connectivity. Our results are based on a linear-time algorithm that computes the -edge cuts of a -edge-connected graph , and a linear-time procedure that, given the collection of all -edge cuts, partitions the vertices of into the -edge-connected components.
Cite
@article{arxiv.2105.02910,
title = {Computing the $4$-Edge-Connected Components of a Graph in Linear Time},
author = {Loukas Georgiadis and Giuseppe F. Italiano and Evangelos Kosinas},
journal= {arXiv preprint arXiv:2105.02910},
year = {2021}
}