Computing the 4-Edge-Connected Components of a Graph: An Experimental Study - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Computing the 4-Edge-Connected Components of a Graph: An Experimental Study

Résumé

The notions of edge-cuts and k-edge-connected components are fundamental in graph theory with numerous practical applications. Very recently, the first linear-time algorithms for computing all the 3-edge cuts and the 4-edge-connected components of a graph have been introduced. In this paper we present carefully engineered implementations of these algorithms and evaluate their efficiency in practice, by performing a thorough empirical study using both real-world graphs taken from a variety of application areas, as well as artificial graphs. To the best of our knowledge, this is the first experimental study for these problems, which highlights the merits and weaknesses of each technique. Furthermore, we present an improved algorithm for computing the 4-edge-connected components of an undirected graph in linear time. The new algorithm uses only elementary data structures, and is implementable in the pointer machine model of computation.
Fichier principal
Vignette du fichier
LIPIcs-ESA-2022-60.pdf (1.47 Mo) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03829988 , version 1 (26-10-2022)

Identifiants

Citer

Loukas Georgiadis, Giuseppe F Italiano, Evangelos Kosinas. Computing the 4-Edge-Connected Components of a Graph: An Experimental Study. ESA 2022 - 30th Annual European Symposium on Algorithms, 2022, Berlin/Potsdam, Germany. ⟨10.4230/LIPIcs.ESA.2022.60⟩. ⟨hal-03829988⟩
33 Consultations
55 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More