Reproduce “A Dichotomy for Terminal Cyclability” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Matthias Bentert, Dario Cavallaro, Sebastian Wiederrecht
The authors give an algorithm for Terminal Cyclability, which asks whether a simple cycle visits every designated vertex of an undirected graph. They use bidimensionality b, the largest k for which an all-red k × k grid occurs as a red-minor, and reduce treewidth to a parameter-dependent logarithmic bound. The running time is |G|^{2^{poly(b)}}, polynomial for fixed b, but not shown fixed-parameter.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.