scientific article

zbMath0801.68126MaRDI QIDQ3140408

Naveen Garg, Vempala S. Santosh, Aman Singla

Publication date: 2 January 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-hardbiconnected subgraphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges ⋮ A polyhedral approach to planar augmentation and related problems ⋮ Finding 2-edge connected spanning subgraphs. ⋮ Approximating the smallest 2-vertex connected spanning subgraph of a directed graph ⋮ On finding a biconnected spanning planar subgraph with applications to the facilities layout problem ⋮ Approximating unweighted connectivity problems in parallel ⋮ Approximating minimum size \{1,2\}-connected networks

This page was built for publication: