scientific article; zbMATH DE number 2080256
From MaRDI portal
Publication:4472504
zbMATH Open1044.68126MaRDI QIDQ4472504FDOQ4472504
Authors: Bill Jackson, Tibor Jordán 
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1969/19690313.htm
Title of this publication is not available (Why is that?)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Cited In (26)
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- A unified framework for bi(tri)connectivity and chordal augmentation
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
- A Fast Algorithm for Optimally Increasing the Edge Connectivity
- Node connectivity augmentation via iterative randomized rounding
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs
- Structured connectivity augmentation
- Structured connectivity augmentation
- Tight approximation algorithm for connectivity augmentation problems
- Directed vertex-connectivity augmentation
- A note on the vertex-connectivity augmentation problem
- Approximating node-connectivity augmentation problems
- Independence free graphs and vertex connectivity augmentation
- Tri-connectivity augmentation in trees
- Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
- Title not available (Why is that?)
- Approximation algorithms for graph augmentation
- Property testing on \(k\)-vertex-connectivity of graphs
- Augmenting forests to meet odd diameter requirements
- Primal-dual approach for directed vertex connectivity augmentation and generalizations
- An Efficient Vertex Addition Method for Broadcast Networks
- Primal-dual approach for directed vertex connectivity augmentation and generalizations
- Title not available (Why is that?)
- NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems
- Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472504)
