Reproduce “A Linear Kernel for Planar Semitotal Domination” 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
Paloma T. de Lima, Lukas Retschmeier
The authors give a polynomial-time kernel for planar semitotal domination. A solution covers every vertex, and each selected vertex has another selected vertex within distance two. Local rules preserve solutions and witness relationships as they replace parts of the graph. The algorithm rejects no-instances or returns an equivalent instance with at most 358k vertices, a proof bound, not a speedup.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.