Approximating the smallest 2-vertex-connected spanning subgraph via low-high orders

DOI10.4230/LIPICS.SEA.2017.9MaRDI QIDQ4580153zbMATH OpenFDO

Authors Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou

Publication date 13 August 2018

zbMATH Keywords

approximation algorithmsdirected graphs2-vertex connectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
• Biconnectivity approximations and graph carvings
• Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
• Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs
• Sparse certificates for 2-connectivity in directed graphs

Cited in

(4)

• Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
• scientific article; zbMATH DE number 6696497 (Why is no real title available?)
• Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs
• Approximating the smallest 2-vertex connected spanning subgraph of a directed graph

This page was built for publication: Approximating the smallest 2-vertex-connected spanning subgraph via low-high orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580153)