A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs
Data Structures and Algorithms
2024-08-14 v2
Abstract
A linear-time algorithm for generating auxiliary subgraphs for the 3-edge-connected components of a connected multigraph is presented. The algorithm uses an innovative graph contraction operation and makes only one pass over the graph. By contrast, the previously best-known algorithms make multiple passes over the graph to decompose it into its 2-edge-connected components or 2-vertex-connected components, then its 3-edge-connected components or 3-vertex-connected components, and then construct a cactus representation for the 2-cuts to generate the auxiliary subgraphs for the 3-edge-connected components.
Keywords
Cite
@article{arxiv.2309.13827,
title = {A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs},
author = {Yung H. Tsin},
journal= {arXiv preprint arXiv:2309.13827},
year = {2024}
}
Comments
21 pages, 1 figure