Approximating twin-width is FPT parameterized by treedepth via oriented twin-width, and exact twin-width computation is FPT parameterized by vertex integrity.
URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Defines TLFPT as O(n) + f(k) algorithms, proves it is strictly contained in Linear FPT via diagonalization, and exhibits several problems (SAT, Vertex Cover, k-Path, etc.) that belong to TLFPT under parameters such as treedepth and BFS-width.
citing papers explorer
-
Computing Twin-Width via Treedepth and Vertex Integrity
Approximating twin-width is FPT parameterized by treedepth via oriented twin-width, and exact twin-width computation is FPT parameterized by vertex integrity.