Skip to Main content Skip to Navigation
Journal articles

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

Document type :
Journal articles
Complete list of metadata

Cited literature [36 references]  Display  Hide  Download

https://hal.inria.fr/hal-02335015
Contributor : Marie-France Sagot Connect in order to contact the contributor
Submitted on : Monday, October 28, 2019 - 9:06:49 AM
Last modification on : Friday, January 8, 2021 - 11:22:05 AM
Long-term archiving on: : Wednesday, January 29, 2020 - 1:24:52 PM

File

2VCSS.pdf
Files produced by the author(s)

Identifiers

Collections

`

Citation

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

Share

Metrics

Record views

82

Files downloads

485