Approximating the smallest 2-vertex connected spanning subgraph of a directed graph - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2019

Approximating the smallest 2-vertex connected spanning subgraph of a directed graph

(1) , (2, 3) , (2)
1
2
3
Fichier principal
Vignette du fichier
2VCSS.pdf (722.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02335015 , version 1 (28-10-2019)

Identifiers

Cite

Loukas Georgiadis, Giuseppe F Italiano, Aikaterini Karanasiou. Approximating the smallest 2-vertex connected spanning subgraph of a directed graph. Theoretical Computer Science, 2019, pp.1-16. ⟨10.1016/j.tcs.2019.09.040⟩. ⟨hal-02335015⟩

Collections

INRIA INRIA2
20 View
177 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More