Geodesic
A Simple Randomized 3-edge Connected Component Algorithm
Serdica Journal of Computing, Tome 12 (2018) no. 4, pp. 265-280

Voir la notice de l'article provenant de la source Bulgarian Digital Mathematics Library

Finding the 3-edge connected components of a graph is a well-researched problem for which many algorithms are known. In this paper, we present a new linear-time randomized algorithm for the problem. To the best of our knowledge, this is the first randomized algorithm for partitioning a graph into 3-edge connected components. The algorithm is a composition of simple building blocks, it is easy to understand and implement, and it has no corner cases.
Keywords: Graph, Algorithm 
@article{SJC_2018_12_4_a3,
     author = {Haralampiev, Vladislav},
     title = {A {Simple} {Randomized} 3-edge {Connected} {Component} {Algorithm}},
     journal = {Serdica Journal of Computing},
     pages = {265--280},
     publisher = {mathdoc},
     volume = {12},
     number = {4},
     year = {2018},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SJC_2018_12_4_a3/}
}
TY  - JOUR
AU  - Haralampiev, Vladislav
TI  - A Simple Randomized 3-edge Connected Component Algorithm
JO  - Serdica Journal of Computing
PY  - 2018
SP  - 265
EP  - 280
VL  - 12
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SJC_2018_12_4_a3/
LA  - en
ID  - SJC_2018_12_4_a3
ER  - 
%0 Journal Article
%A Haralampiev, Vladislav
%T A Simple Randomized 3-edge Connected Component Algorithm
%J Serdica Journal of Computing
%D 2018
%P 265-280
%V 12
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SJC_2018_12_4_a3/
%G en
%F SJC_2018_12_4_a3
Haralampiev, Vladislav. A Simple Randomized 3-edge Connected Component Algorithm. Serdica Journal of Computing, Tome 12 (2018) no. 4, pp. 265-280. http://geodesic.mathdoc.fr/item/SJC_2018_12_4_a3/