FPT algorithms exist for k-Inversion on tournaments (generalized), block graphs, and general digraphs via treewidth parameterization.
Diameter of the inversion graph.arXiv preprint
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
The (≤p)-inversion diameter of any graph G is at most ceil(|E(G)| / floor(p/2)) + Ψ_p, where Ψ_p satisfies (p/4 - 3/2) ≤ Ψ_p ≤ p²/2, with improved linear-in-n bounds for trees and planar graphs.
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.
-
On the $(\leq p)$-inversion diameter of oriented graphs
The (≤p)-inversion diameter of any graph G is at most ceil(|E(G)| / floor(p/2)) + Ψ_p, where Ψ_p satisfies (p/4 - 3/2) ≤ Ψ_p ≤ p²/2, with improved linear-in-n bounds for trees and planar graphs.