An algorithm solves ARRIVAL in time 2^{O(k log^2 n)} on n-vertex graphs of treewidth k, and G-ARRIVAL reduces to finding approximate fixed points of l1-contractions.
26 Thomas Webster
1 Pith paper cite this work, alongside 1 external citations. Polarity classification is still indexing.
1
Pith paper citing it
1
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
ARRIVAL: Recursive Framework & $\ell_1$-Contraction
An algorithm solves ARRIVAL in time 2^{O(k log^2 n)} on n-vertex graphs of treewidth k, and G-ARRIVAL reduces to finding approximate fixed points of l1-contractions.