Vertex connectivity augmentation is FPT parameterized by λ and k with running time 2^{O(k log(k+λ))} n^{O(1)}; edge connectivity augmentation is FPT parameterized by k alone.
Eswaran and Robert Endre Tarjan , title =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Connectivity augmentation is fixed-parameter tractable
Vertex connectivity augmentation is FPT parameterized by λ and k with running time 2^{O(k log(k+λ))} n^{O(1)}; edge connectivity augmentation is FPT parameterized by k alone.