Inversions of size exactly p characterize when large digraphs become k-arc-strong, while at most p-sized inversions admit a (4k-2+ε)-approximation for the minimum number needed and are NP-hard and APX-hard to optimize.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
FPT algorithms exist for k-Inversion on tournaments (generalized), block graphs, and general digraphs via treewidth parameterization.
citing papers explorer
-
Increasing arc-connectivity by bounded- and fixed-size inversions
Inversions of size exactly p characterize when large digraphs become k-arc-strong, while at most p-sized inversions admit a (4k-2+ε)-approximation for the minimum number needed and are NP-hard and APX-hard to optimize.
-
Parameterized algorithms for $k$-Inversion
FPT algorithms exist for k-Inversion on tournaments (generalized), block graphs, and general digraphs via treewidth parameterization.