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.
Schrijver.Combinatorial Optimization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.