Determining 4-edge-connected components in linear time
Data Structures and Algorithms
2021-05-06 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2105.01699,
title = {Determining 4-edge-connected components in linear time},
author = {Wojciech Nadara and Mateusz Radecki and Marcin Smulewicz and Marek Sokołowski},
journal= {arXiv preprint arXiv:2105.01699},
year = {2021}
}