Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1256717
- On shredders and vertex connectivity augmentation
- k-shredders ink-connected graphs
- scientific article; zbMATH DE number 1979495
- scientific article; zbMATH DE number 1670666
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
- Approximation algorithms for connectivity augmentation problems
- Approximating Node-Connectivity Augmentation Problems
- Approximating node-connectivity augmentation problems
- On (t,k)-shredders in k-connected graphs.
Cited in
(11)- Independence free graphs and vertex connectivity augmentation
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- scientific article; zbMATH DE number 5304947 (Why is no real title available?)
- scientific article; zbMATH DE number 1256717 (Why is no real title available?)
- Global and fixed-terminal cuts in digraphs
- The firebreak problem
- Finding most-shattering minimum vertex cuts of polylogarithmic size in near-linear time
- Graph connectivity and its augmentation: Applications of MA orderings
- Power optimization for connectivity problems
- On shredders and vertex connectivity augmentation
- Edges not contained in triangles and the number of contractible edges in a 4-connected graph
This page was built for publication: Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4939604)