FPT algorithms exist for k-Inversion on tournaments (generalized), block graphs, and general digraphs via treewidth parameterization.
Title resolution pending
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
-
Parameterized algorithms for $k$-Inversion
FPT algorithms exist for k-Inversion on tournaments (generalized), block graphs, and general digraphs via treewidth parameterization.