Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2021.47
URN: urn:nbn:de:0030-drops-146286
URL: https://drops.dagstuhl.de/opus/volltexte/2021/14628/
Georgiadis, Loukas ; Italiano, Giuseppe F. ; Kosinas, Evangelos
Computing the 4-Edge-Connected Components of a Graph in Linear Time
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@InProceedings{georgiadis_et_al:LIPIcs.ESA.2021.47,
author = {Georgiadis, Loukas and Italiano, Giuseppe F. and Kosinas, Evangelos},
title = {{Computing the 4-Edge-Connected Components of a Graph in Linear Time}},
booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)},
pages = {47:1--47:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-204-4},
ISSN = {1868-8969},
year = {2021},
volume = {204},
editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14628},
URN = {urn:nbn:de:0030-drops-146286},
doi = {10.4230/LIPIcs.ESA.2021.47},
annote = {Keywords: Cuts, Edge Connectivity, Graph Algorithms}
}
| Keywords: | Cuts, Edge Connectivity, Graph Algorithms | |
| Seminar: | 29th Annual European Symposium on Algorithms (ESA 2021) | |
| Issue date: | 2021 | |
| Date of publication: | 31.08.2021 |
