Improved Linear-Time Algorithm for Computing the $4$-Edge-Connected Components of a Graph
Data Structures and Algorithms
2021-08-20 v1
Abstract
We present an improved algorithm for computing the -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.
Cite
@article{arxiv.2108.08558,
title = {Improved Linear-Time Algorithm for Computing the $4$-Edge-Connected Components of a Graph},
author = {Loukas Georgiadis and Giuseppe F. Italiano and Evangelos Kosinas},
journal= {arXiv preprint arXiv:2108.08558},
year = {2021}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2105.02910