Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: 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 : 2018

Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study

Résumé

Motivated by very recent work on 2-connectivity in directed graphs, we revisit the problem of computing the 2-edge-and 2-vertex-connected components, and the maximal 2-edge-and 2-vertex-connected subgraphs of a directed graph G. We explore the design space for efficient algorithms in practice, based on recently proposed techniques, and conduct a thorough empirical study to highlight the merits and weaknesses of each technique.
Fichier non déposé

Dates et versions

hal-01925963 , version 1 (19-11-2018)

Identifiants

  • HAL Id : hal-01925963 , version 1

Citer

Loukas Georgiadis, Giuseppe F Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel. Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study. Workshop on Algorithm Engineering and Experiments, 2018, New Orleans, United States. ⟨hal-01925963⟩
6 Consultations
2 Téléchargements

Partager

Gmail Facebook X LinkedIn More