scientific article; zbMATH DE number 2080256
From MaRDI portal
Publication:4472504
zbMath1044.68126MaRDI QIDQ4472504
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1969/19690313.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (7)
An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach ⋮ Property testing on \(k\)-vertex-connectivity of graphs ⋮ Approximating node-connectivity augmentation problems ⋮ Tight approximation algorithm for connectivity augmentation problems ⋮ A \(4+\epsilon\) approximation for \(k\)-connected subgraphs ⋮ Independence free graphs and vertex connectivity augmentation ⋮ Augmenting forests to meet odd diameter requirements
This page was built for publication:
