Approximating the smallest 2-vertex connected spanning subgraph of a directed graph - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2019

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
21 View
207 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More